On Specifying Timeouts

DOI10.1016/J.ENTCS.2005.12.083MaRDI QIDQ5262963zbMATH OpenOpenAlexFDO

Authors Rob 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

fairnessconcurrencyPetri netsprocess algebralivenessprioritiestimeouts

Mathematics Subject Classification ID

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

Cites work

• On the consistency of Koomen's fair abstraction rule

Cited in

(4)

• scientific article; zbMATH DE number 2090022 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 7350777 (Why is no real title available?)

This page was built for publication: On Specifying Timeouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262963)