An algebraic theory of fair asynchronous communicating processes

DOI10.1016/0304-3975(87)90004-1MaRDI QIDQ1088403zbMATH OpenOpenAlexFDO

Authors Matthew Hennessy

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)90004-1

zbMATH Keywords

denotational semanticsfair asynchronous communicating processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Review text

Cf. the review of the preliminary version [Lect. Notes Comput. Sci. 194, 260-269 (1985)] in Zbl 0566.68022.

Cites work

• A calculus of communicating systems
• Acceptance trees
• scientific article; zbMATH DE number 3821089 (Why is no real title available?)
• scientific article; zbMATH DE number 3900141 (Why is no real title available?)
• scientific article; zbMATH DE number 3714908 (Why is no real title available?)
• Proof rules and transformations dealing with fairness
• Synchronous and asynchronous experiments on processes
• Testing equivalences for processes

Cited in

(10)

• A fixpoint approach to finite delay and fairness
• Semantics for finite delay
• Strong fairness and full abstraction for communicating processes
• Fair simulation
• Fairness and communication-based semantics for session-typed languages
• Fair \(\pi\)
• scientific article; zbMATH DE number 1231450 (Why is no real title available?)
• scientific article; zbMATH DE number 1330452 (Why is no real title available?)
• Divergence and fair testing
• Fair simulation

This page was built for publication: An algebraic theory of fair asynchronous communicating processes

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