Fair Π

DOI10.1016/J.ENTCS.2006.10.051zbMath1277.68168OpenAlexW2914165734MaRDI QIDQ2866341

Catuscia Palamidessi, D. Cacciagrano, Flavio Corradini

Publication date: 13 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.051

zbMATH Keywords

pi-calculustesting semanticsstrong fairnessweak fairness

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)

Related Items (1)

Separation of synchronous and asynchronous communication via testing

Cites Work

• A fair calculus of communicating systems
• An algebraic theory of fair asynchronous communicating processes
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• A calculus of mobile processes. I
• Weak and strong fairness in CCS
• Testing equivalence for mobile processes
• Algebraic specification and verification of communication protocols
• Divergence and fair testing
• CONCUR 2003 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fair Π