Skip to main content

TS

The coarsest precongruences respecting safety and liveness properties

Authors

Rob van Glabbeek

NICTA

UNSW

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.

BibTeX Entry

  @inproceedings{vanGlabbeek_10,
    publisher        = {Springer},
    author           = {van Glabbeek, Robert},
    issn             = {1868-4238},
    month            = sep,
    editor           = {{C.S. Calude \& V. Sassone}},
    year             = {2010},
    keywords         = {safety properties, liveness properties, conditional liveness properties, refinement preorders,
                        labelled transition systems, full abstraction, process algebra, partially synchronous interleaving
                        operator, abstraction, state operator, deadlock, divergence},
    title            = {The Coarsest Precongruences Respecting Safety and Liveness Properties},
    booktitle        = {Theoretical Computer Science 2010},
    pages            = {32-52},
    address          = {Brisbane}
  }

Download

Served by Apache on Linux on seL4.