Skip to main content

Justness: A completeness criterion for capturing liveness properties


Rob van Glabbeek


UNSW Sydney


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

    publisher        = {Springer},
    doi              = {\_29},
    month            = apr,
    booktitle        = {Proceedings of the  22nd International Conference on Foundations of Software Science and
                        Computational Structures},
    paperurl         = {},
    series           = {Lecture Notes in Computer Science},
    year             = {2019},
    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.},
    volume           = {LNCS 11425},
    title            = {Justness: {A} Completeness Criterion for Capturing Liveness Properties},
    pages            = {505-522},
    author           = {van Glabbeek, Rob},
    date             = {2019-4-5},
    address          = {Prague, Czech Republic}