A randomized distributed encoding of the π-calculus with mixed choice

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 537-549

  Palamidessi, Catuscia ^a   Herescu, Oltea Mihaela ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; ENCODING (SYMBOLS); SEMANTICS; SIGNAL ENCODING;

MIXED CHOICE; PI CALCULUS; PROBABILISTIC EXTENSION; RANDOMIZED APPROACH; RELATIVE SPEED; TESTING SEMANTICS;

CALCULATIONS;

EID: 84891131745     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_44     Document Type: Article

References (24)

1. Roberto M. Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science, 195(2):291-324, 1998.
2. Michele Boreale and Rocco De Nicola. Testing equivalence for mobile processes. Information and Computation, 120(2):279-303, 1995.
3. N. Francez and M. Rodeh. A distributed abstract data type implemented by a probabilistic communication scheme. In Proc. of FOCS, pages 373-379,1980.
4. Oltea Mihaela Herescu and Catuscia Palamidessi. Probabilistic asynchronous π-calculus. In Proc. Of FOSSACS, LNCS 1784, pages 146-160. Springer-Verlag, 2000.
5. Oltea Mihaela Herescu and Catuscia Palamidessi. On the generalized dining philosophers problem. In Proc. Of PODC, pages 81-89, 2001.
6. Kohei Honda and Mario Tokoro. An object calculus for asynchronous communication. In Proc. Of ECOOP, LNCS 512, pages 133-147. Springer-Verlag, 1991.
7. Bengt Jonsson, Kim G. Larsen, and Wang Yi. Probabilistic extensions of process algebras. In J. Bergstra, A. Ponse, and S. Smolka, Eds., Handbook of Process Algebras. Elsevier. 2001.
8. Bengt Jonsson and Wang Yi. Compositional testing preorders for probabilistic processes. In Proc. of LICS, pages 431-441, 1995. IEEE Computer Society Press.
9. Yuh-Jzer Joung and Scott A. Smolka. Strong interaction fairness via randomization. IEEE Transactions on Parallel and Distributed Systems, 9(2): 137-149, 1998.
10. F. Knabe. A distributed protocol for channel-based communications with choice. Computers and Artificial Intelligence, 12(5):475-490, 1993.
11. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, I and II. Information and Computation, 100(1): 1-40 & 41-77, 1992.
12. Uwe Nestmann. What is a 'good' encoding of guarded choice? Journal of Information and Computation, 156:287-319, 2000.
13. Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. Journal of Information and Computation, 163:1-59, 2000.
14. Rocco De Nicola and Matthew C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34(l-2):83-133, 1984.
15. Catuscia Palamidessi. Comparing the expressive power of the synchronous and the asynchronous π-calculus. To appear in Mathematical Structures in Computer Science. A preliminary version appeared in Proc. Of POPL'97.
16. Catuscia Palamidessi and Oltea Mihaela Herescu. A randomized distribuited encoding of the π-calculus with mixed choice. Internal Report. Postscript available at http://www.cse.psu.edu/~catuscia/papers/Prob_impl/report.ps.
17. Joachim Parrow and Peter Sjodin. Multiway synchronization verified with coupled simulation. In Proc. of CONCUR, LNCS 630, pages 518-533. Springer-Verlag, 1992.
18. Michael O. Rabin and Daniel Lehmann. On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In A. W. Roscoe, editor, A Classical Mind: Essays in Honour of C.A.R. Hoare, chapter 20, pages 333-352
19. Prentice Hall, 1994. An extended abstract appeared in the Proc. of POPL'81, pages 133-138.
20. John H. Reif and Paul G. Spirakis. Real-time synchronization of interprocess communications. ACM Trans, on Programming Languages and Systems, 6(2):215-238, 1984.
21. Davide Sangiorgi. π-calculus, internal mobility and agent-passing calculi. Theoretical Computer Science, 167(l,2):235-274, 1996.
22. Roberto Segala. Testing probabilistic automata. In Proc. of CONCUR, LNCS 1119, pages 299-314, 1996. Springer-Verlag.
23. Roberto Segala and Nancy Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
24. Yih-Kuen Tsay and Rajive L. Bagrodia. Fault-tolerant algorithms for fair interprocess synchronization. IEEE Trans, on Parallel and Distributed Systems, 5(7):737-748, 1994.