An introduction to the regular theory of fairness

DOI10.1016/0304-3975(87)90126-5zbMath0643.68025OpenAlexW1980987433MaRDI QIDQ1102102

Lutz Priese, Uwe Willecke-Klemme, Ralf Rehrmann

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90126-5

zbMATH Keywords

fairnessconcurrent systemsformal language theory\(\omega \)- regularity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of operating systems (68N25)

Related Items (3)

Somewhat finite approaches to infinite sentences. ⋮ On the minimal number of \(\times\) operators to model regularity in fair SCCS ⋮ Fairness and regularity for SCCS processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fair calculus of communicating systems
• Fairness and conspiracies
• Proof rules and transformations dealing with fairness
• About fair asynchrony
• A calculus of communicating systems
• Adherences of languages
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Testing equivalences for processes
• Communicating sequential processes
• Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: An introduction to the regular theory of fairness