English

The Coarsest Precongruences Respecting Safety and Liveness Properties

Logic in Computer Science 2018-12-31 v2

Abstract

This paper characterises the coarsest refinement preorders on labelled transition systems that are precongruences for renaming and partially synchronous interleaving operators, and respect all safety, liveness, and conditional liveness properties, respectively.

Keywords

Cite

@article{arxiv.1007.5491,
  title  = {The Coarsest Precongruences Respecting Safety and Liveness Properties},
  author = {Rob van Glabbeek},
  journal= {arXiv preprint arXiv:1007.5491},
  year   = {2018}
}

Comments

2018: A reference to Lamport has been corrected into one to Alpern & Schneider