Abstract / Description of output
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.
Original language | English |
---|---|
Title of host publication | Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings |
Editors | Mikołaj Bojańczyk, Alex Simpson |
Place of Publication | Cham |
Publisher | Springer |
Pages | 505-522 |
Number of pages | 18 |
ISBN (Electronic) | 978-3-030-17127-8 |
ISBN (Print) | 978-3-030-17126-1 |
DOIs | |
Publication status | Published - 5 Apr 2019 |
Event | 22nd International Conference on Foundations of Software Science and Computation Structures, 2019 - Prague, Czech Republic Duration: 8 Apr 2019 → 11 Apr 2019 Conference number: 22 |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Cham |
Volume | 11425 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 22nd International Conference on Foundations of Software Science and Computation Structures, 2019 |
---|---|
Abbreviated title | FoSSaCS 2019 |
Country/Territory | Czech Republic |
City | Prague |
Period | 8/04/19 → 11/04/19 |