On Specifying Timeouts

DOI10.1016/j.entcs.2005.12.083zbMath1316.68109OpenAlexW1971607272MaRDI QIDQ5262963

Robert J. van Glabbeek

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.083

zbMATH Keywords

fairnesslivenessprocess algebraPetri netsconcurrencyprioritiestimeouts

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Unnamed Item ⋮ Explicit Identifiers and Contexts in Reversible Concurrent Calculus ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

Cites Work

• On the consistency of Koomen's fair abstraction rule

This page was built for publication: On Specifying Timeouts