On Specifying Timeouts

DOI10.1016/J.ENTCS.2005.12.083zbMATH Open1316.68109OpenAlexW1971607272MaRDI QIDQ5262963FDOQ5262963

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)

• Title not available (Why is that?)
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Explicit Identifiers and Contexts in Reversible Concurrent Calculus
• Title not available (Why is that?)

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)