Global and local views of state fairness

DOI10.1016/0304-3975(91)90206-HzbMATH Open0727.68078OpenAlexW2016220909MaRDI QIDQ804304FDOQ804304

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

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

Recommendations

• scientific article; zbMATH DE number 4070338
• scientific article; zbMATH DE number 4024804
• \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
• scientific article; zbMATH DE number 3982496
• scientific article; zbMATH DE number 4096790

zbMATH Keywords

fairnessPetri netsconcurrent programs

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

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

Cited In (4)

• \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Communicating processes, scheduling, and the complexity of nontermination
• On deadlock and fairness decision problems for computations on client-server systems

This page was built for publication: Global and local views of state fairness

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