REVIEW 2 cited by
Progress, Fairness and Justness in Process Algebra
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
To prove liveness properties of concurrent systems, it is often necessary to postulate progress, fairness and justness properties. This paper investigates how the necessary progress, fairness and justness assumptions can be added to or incorporated in a standard process-algebraic specification formalism. We propose a formalisation that can be applied to a wide range of process algebras. The presented formalism is used to reason about route discovery and packet delivery in the setting of wireless networks.
Forward citations
Cited by 2 Pith papers
-
Justness: A Completeness Criterion for Capturing Liveness Properties
This paper defines a synchron-based concurrency relation for CCS, ABC, and CCSS, making the justness criterion formally available and proving it agrees with previous coinductive definitions.
-
Ensuring Liveness Properties of Distributed Systems: Open Problems
A research agenda for a theory of concurrency that proves liveness properties using justness instead of fairness, because fairness assumptions can yield conclusions that do not hold in reality.
Discussion (0). Continue with ORCID to comment.