Fair Π

Electronic Notes in Theoretical Computer Science

Volumn 175, Issue 3, 2007, Pages 3-26

  Cacciagrano, Diletta ^a   Corradini, Flavio ^a   Palamidessi, Catuscia ^b  

^a UNIVERSITY OF CAMERINO   (Italy)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Pi Calculus; Strong Fairness; Testing Semantics; Weak Fairness

Indexed keywords

INFORMATION ANALYSIS; SEMANTICS;

PI-CALCULUS; STRONG FAIRNESS; TESTING SEMANTICS;

COMPUTATIONAL METHODS;

EID: 34250337780     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.10.051     Document Type: Article

References (23)

1. Boreale M., and De Nicola R. Testing Equivalence for Mobile Processes. Information and Computation 120 (1995) 279-303
2. Boudol, G., "Asynchrony and the π-calculus", Technical Report 1702, INRIA, Sophia-Antipolis (1992)
3. Brinksma E., Rensink A., and Vogler W. Fair Testing. Proc. of CONCUR'95. LNCS 962 (1995) 313-327
4. Brinksma E., Rensink A., and Vogler W. Applications of Fair Testing. Protocols Specification, Testing and Verification (XVI) (1996), Chapman & Hall 145-160
5. Cacciagrano D., Corradini F., and Palamidessi C. Separation of Synchronous and Asynchronous Communication Via Testing. Proc. of EXPRESS'05. ENTCS 154 3 (2006) 95-108 To appear in Theoretical Computer Science
6. Corradini F., Di Berardini M.R., and Vogler W. Relating Fairness and Timing in Process Algebra. Proc. of Concur'03. LNCS 2761 (2003) 438-452
7. Corradini F., Di Berardini M.R., and Vogler W. Fairness of Components in System Computations. ENTCS 128 2 (2005) 35-52
8. Fournet, C. & Gonthier, G., A Hierarchy of Equivalences for Asynchronous Calculi, Proc. of ICALP'98 (1998), 844-855
9. Costa G., and Stirling C. A Fair Calculus of Communicating Systems. Acta Informatica 21 (1984) 417-441
10. Costa G., and Stirling C. Weak and Strong Fairness in CCS. Information and Computation 73 (1987) 207-244
11. Francez N. Fairness (1986), Springer-Verlag
12. Hennessy M. An Algebraic Theory of Fair Asynchronous Communicating Processes. Theoretical Computer Science 49 (1987) 121-143
13. Honda K., and Tokoro M. An Object calculus for Asynchronous Communication. Proc. of ECOOP '91. LNCS 512 (1991) 133-147
14. Honda K., and Yoshida N. Replication in Concurrent Combinators. Proc. of TACS '94. LNCS 789 (1994)
15. Koomen C. Albegraic Specification and Verification of Communications protocols. Science of Computer Programming 5 (1985) 1-36
16. Lehmann D., Pnueli A., and Stavi J. Impartiality, justice and Fairness:the Ethics of Concurrent Termination. Proc. of 8th Int. Colloq. Aut. Lang. Prog. LNCS 115 (1981) 264-277
17. Milner R. Communication and Concurrency (1989), Prentice-Hall International
18. Milner R., Parrow J., and Walker D. A Calculus of Mobile Processes, Part I and II. Information and Computation 100 (1992) 1-78
19. Natarajan V., and Cleaveland R. Divergence and Fair Testing. Proc. of ICALP '95. LNCS 944 (1995) 648-659
20. Núñez M., and Rupérez D. Fair testing through probabilistic testing. Acta Informatica 19 (1983) 195-210
21. Núñez M., and Rupérez D. Fair testing through probabilistic testing. Protocol Specification, Testing, and Verification 19 (1999), Kluwer Academic Publishers 135-150
22. Pnueli A. On the Extremely Fair Treatment of Probabilistic Algorithms. Proc. of ACM Symph. Theory of Comp. (1983) 278-290
23. Queille J.P., and Sifakis J. Fairness and Related Properties in Transition Systems-A Temporal Logic to Deal with Fairness. Acta Informatica 19 (1983) 195-210