About fair asynchrony

DOI10.1016/0304-3975(85)90095-7zbMath0607.68016OpenAlexW2149314970MaRDI QIDQ1085603

Philippe Darondeau

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90095-7

zbMATH Keywords

fairnessparallelismasynchronyinfinitary languagescommunicationsasynchronous agentsclassical algebraic domainssemantic modelling of a CCS-like language

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Related Items (8)

An introduction to the regular theory of fairness ⋮ On the minimal number of \(\times\) operators to model regularity in fair SCCS ⋮ Abstract fairness and semantics ⋮ Fairness and regularity for SCCS processes ⋮ The chemical abstract machine ⋮ Strong fairness and ultra metrics ⋮ Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages ⋮ Strong fairness and full abstraction for communicating 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
• Calculi for synchrony and asynchrony
• Towards a formal proof system for \(\omega\)-rational expressions
• A calculus of communicating systems
• Fully abstract models of typed \(\lambda\)-calculi
• A structural approach to operational semantics
• Synchronous and asynchronous experiments on processes
• A Theory of Communicating Sequential Processes
• Flowgraphs and Flow Algebras
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment

This page was built for publication: About fair asynchrony