Keep it fair: equivalence and composition

DOI10.1016/J.JLAMP.2019.01.004MaRDI QIDQ2423741zbMATH OpenOpenAlexWikidataFDO

Authors Stephan Mennicke, Tobias Prehn

Publication date 20 June 2019

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2019.01.004

zbMATH Keywords

equivalencefairnesslabeled transition systemsparallel composition

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Keep it fair: equivalences
• Appraising fairness in languages for distributed programming
• Stepwise development of fair distributed systems
• scientific article; zbMATH DE number 4096758
• scientific article; zbMATH DE number 1231579

Cites work

• A calculus of communicating systems
• A fair calculus of communicating systems
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Algebraic specification and verification of communication protocols
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Communicating sequential processes
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Fair testing
• Fairness of actions in system computations
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 1106703 (Why is no real title available?)
• scientific article; zbMATH DE number 3806938 (Why is no real title available?)
• scientific article; zbMATH DE number 1863165 (Why is no real title available?)
• Keep it fair: equivalences
• Mutex needs fairness
• Processes and the denotational semantics of concurrency
• Theoretical Aspects of Computing – ICTAC 2005

Cited in

(16)

• About fair asynchrony
• On equivalence-completions of fairness assumptions
• On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies
• Preface for the special issue on interaction and concurrency experience 2017
• Fairness of actions in system computations
• On deadlock and fairness decision problems for computations on client-server systems
• scientific article; zbMATH DE number 3846854 (Why is no real title available?)
• scientific article; zbMATH DE number 3890707 (Why is no real title available?)
• A Distributed Maximal Scheduler for Strong Fairness
• scientific article; zbMATH DE number 4096758 (Why is no real title available?)
• scientific article; zbMATH DE number 140260 (Why is no real title available?)
• scientific article; zbMATH DE number 1231579 (Why is no real title available?)
• scientific article; zbMATH DE number 2036567 (Why is no real title available?)
• scientific article; zbMATH DE number 2080199 (Why is no real title available?)
• Keep it fair: equivalences
• A note on fairness in I/O automata

This page was built for publication: Keep it fair: equivalence and composition

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