Global and local views of state fairness

DOI10.1016/0304-3975(91)90206-HzbMath0727.68078OpenAlexW2016220909MaRDI QIDQ804304

Rodney R. Howell, Hsu-Chun Yen, Louis E. Rosier

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90206-h

zbMATH Keywords

fairnessconcurrent programsPetri nets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• The complexity of problems in systems of communicating sequential processes
• The choice coordination problem
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Complexity of some problems in Petri nets
• The covering and boundedness problems for vector addition systems
• Modalities for model checking: Branching time logic strikes back
• Parallel program schemata
• Proving liveness for networks of communicating finite state machines
• The complexity of propositional linear temporal logics
• Alternation
• Communicating sequential processes
• Termination of Probabilistic Concurrent Program