Trustworthy Systems

Justness: A completeness criterion for capturing liveness properties

Authors

Rob van Glabbeek

DATA61

UNSW Sydney

Abstract

This paper poses that transition systems constitute a good model of distributed systems only in combination with a criterion telling which paths model complete runs of the represented systems. Among such criteria, progress is too weak to capture relevant liveness properties, and fairness is often too strong; for typical applications we advocate the intermediate criterion of justness. Previously, we proposed a definition of justness in terms of an asymmetric concurrency relation between transitions. Here we define such a concurrency relation for the transition systems associated to the process algebra CCS as well as its extensions with broadcast communication and signals, thereby making these process algebras suitable for capturing liveness properties requiring justness.

BibTeX Entry

  @inproceedings{vanGlabbeek_19,
    address          = {Prague, Czech Republic},
    author           = {van Glabbeek, Robert},
    booktitle        = {International Conference on Foundations of Software Science and Computational Structures},
    date             = {2019-4-5},
    doi              = {https://doi.org/10.1007/978-3-030-17127-8\_29},
    editor           = {{Bojańczyk, Mikolaj and Simpson, Alex}},
    keywords         = {Justness; progress, fairness; completeness criteria; liveness; distributed systems; process algebra;
                        labelled transition systems with concurrency; {CCS}; broadcast communication; signals.},
    month            = apr,
    pages            = {505-522},
    paperurl         = {https://trustworthy.systems/publications/full_text/vanGlabbeek_19.pdf},
    publisher        = {Springer},
    series           = {Lecture Notes in Computer Science},
    title            = {Justness: {A} Completeness Criterion for Capturing Liveness Properties},
    volume           = {LNCS 11425},
    year             = {2019}
  }

Download