An introduction to the regular theory of fairness

DOI10.1016/0304-3975(87)90126-5MaRDI QIDQ1102102zbMATH OpenOpenAlexFDO

Authors Lutz Priese, Ralf Rehrmann, Uwe Willecke-Klemme

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)

Recommendations

• scientific article; zbMATH DE number 3990856
• Introduction to the theory of fair allocation
• A proposal to unify some concepts in the theory of fairness
• On the fairness of random procedures
• Fairness in resource allocation: foundation and applications
• The informational basis of the theory of fair allocation
• On complete primitives for fairness
• On equivalence-completions of fairness assumptions
• Axiomatic foundations for fairness-motivated preferences

Cites work

• scientific article; zbMATH DE number 3831300 (Why is no real title available?)
• scientific article; zbMATH DE number 3924161 (Why is no real title available?)
• scientific article; zbMATH DE number 3965428 (Why is no real title available?)
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 3990856 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3735115 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• A calculus of communicating systems
• A fair calculus of communicating systems
• About fair asynchrony
• Adherences of languages
• Communicating sequential processes
• Depth-First Search and Linear Graph Algorithms
• Fairness and conspiracies
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines
• Proof rules and transformations dealing with fairness
• Testing equivalences for processes

Cited in

(5)

• scientific article; zbMATH DE number 4185038 (Why is no real title available?)
• On the minimal number of operators to model regularity in fair SCCS
• Fairness and regularity for SCCS processes
• To be fair
• Somewhat finite approaches to infinite sentences.

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

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