Global and local views of state fairness

DOI10.1016/0304-3975(91)90206-HMaRDI QIDQ804304zbMATHOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 3911720 (Why is no real title available?)
• scientific article; zbMATH DE number 4024804 (Why is no real title available?)
• scientific article; zbMATH DE number 4070338 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 3735115 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• Alternation
• Communicating sequential processes
• Complexity of some problems in Petri nets
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Modalities for model checking: Branching time logic strikes back
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• Parallel program schemata
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• Proving liveness for networks of communicating finite state machines
• Termination of Probabilistic Concurrent Program
• The choice coordination problem
• The complexity of problems in systems of communicating sequential processes
• The complexity of propositional linear temporal logics
• The covering and boundedness problems for vector addition systems

Cited in

(4)

• On deadlock and fairness decision problems for computations on client-server systems
• Communicating processes, scheduling, and the complexity of nontermination
• \(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

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)