Strong fairness and full abstraction for communicating processes

DOI10.1006/INCO.2000.2886zbMath1003.68081OpenAlexW2010167000MaRDI QIDQ1854396

Susan Older

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c6c86b658e6b1cf3b1e1caa917570634d0828b80

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About fair asynchrony
• An algebraic theory of fair asynchronous communicating processes
• Appraising fairness in languages for distributed programming
• A calculus of communicating systems
• A calculus of total correctness for communicating processes
• A fully abstract trace model for dataflow and asynchronous networks
• Fully abstract denotational models for nonuniform concurrent languages
• The essence of parallel Algol.
• Weak and strong fairness in CCS
• Full abstraction for a shared-variable parallel language
• Countable nondeterminism and random assignment
• A Theory of Communicating Sequential Processes
• Acceptance trees
• Communicating sequential processes

This page was built for publication: Strong fairness and full abstraction for communicating processes