Probabilistic π-Calculus and Event Structures

Electronic Notes in Theoretical Computer Science

Volumn 190, Issue 3, 2007, Pages 147-166

  Varacca, Daniele ^a   Yoshida, Nobuko ^b  

^a CNRS   (France)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

calculus; Event structures; linear types; probabilistic processes

Indexed keywords

AUTOMATA THEORY; LINEAR SYSTEMS; MATHEMATICAL OPERATORS; PROBABILITY;

CALCULUS; EVENT STRUCTURES; LINEAR TYPES; PROBABILISTIC PROCESSES;

SEMANTICS;

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

References (39)

1. Abbes S., and Benveniste A. Probabilistic models for true-concurrency: branching cells and distributed probabilities for event structures. Information and Computation 204 2 (2006) 231-274
2. Aldini A., Bravetti M., and Gorrieri R. A process-algebraic approach for the analysis of probabilistic noninterference. Journal of Computer Security 12 2 (2004) 191-245
3. Bartels F., Sokolova A., and de Vink E. A hierarchy of probabilistic system types. Proceedings of 6th CMCS. ENTCS 82 1 (2003) Elsevier
4. Berger M., Honda K., and Yoshida N. Sequentiality and the π-calculus. Proceedings of TLCA'01. LNCS volume 2044 (2001) 29-45
5. Berry G., and Curien P.-L. Sequential algorithms on concrete data structures. Theoretical Computer Science 20 265-321 (1982)
6. Bruni R., Melgratti H., and Montanari U. Event structure semantics for nominal calculi. Proceedings of 17th CONCUR. LNCS volume 4137 (2006), Springer 295-309
7. Chatzikokolakis K., and Palamidessi C. A framework to analyze probabilistic protocols and its application to the partial secrets exchange. Proceedings of Symposium on Trustworthy Global Computing, 2005. LNCS volume 3705 (2005), Springer
8. Danos V., and Harmer R.S. Probabilistic game semantics. ACM Transactions on Computational Logic 3 3 (2002) 359-382
9. Desel J., and Esparza J. Free Choice Petri Nets (1995), Cambridge University Press
10. Desharnais J., Edalat A., and Panangadenm P. Bisimulation for labelled Markov processes. Information and Computation 179 2 (2002) 163-193
11. Di Pierro A., Hankin C., and Wiklicky H. Probabilistic lambda calculus and quantitative program analysis. Journal of Logic and Computation 15 2 (2005) 159-179
12. Faggian C., and Maurel F. Ludics nets, a game model of concurrent interaction. Proceedings of 20th LICS (2005) 376-385
13. Claudia Faggian and Mauro Piccolo. A graph abstract machine describing event structure composition. In Proceedings of the GT-VC workshop, 2006. Short paper
14. Fecher H., Majster-Cederbaum M.E., and Wu J. Action refinement for probabilistic processes with true concurrency models. PAPM-PROBMIV. LNCS volume 2399 (2002), Springer 77-94
15. Hans Hansson. Time and Probability in Formal Design of Distributed systems. PhD thesis, Uppsala University, 1991
16. Herescu M., and Palamidessi C. Probabilistic asynchronous π-calculus. Proceedings of 3rd FoSSaCS. LNCS volume 1784 (2000), Springer 146-160
17. Honda K., and Yoshida N. On reduction-based process semantics. Theoretical Computer Science 151 2 (1995) 385-435
18. Hyland J.M.E., and Ong C.-H.L. On full abstraction for PCF: I, II, and III. Information and Computation 163 2 (2000) 285-408
19. Kahn G., and Plotkin G.D. Concrete domains. Theoretical Computer Science 121 1-2 (1993) 187-277
20. Joost-Pieter Katoen. Quantitative and Qualitative Extensions of Event Structures. PhD thesis, University of Twente, 1996
21. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Information and Computation 94 1 (1991) 1-28
22. Melliès P.-A. Asynchronous games 2: The true concurrency of innocence. Proceedings of 15th CONCUR (2004) 448-465
23. Milner R. Communicating and Mobile Systems: The Pi Calculus (1999), Cambridge University Press
24. Ramsey N., and Pfeffer A. Stochastic lambda calculus and monads of probability distributions. Proceedings of 29th POPL (2002) 154-165
25. Rozenberg G., and Thiagarajan P.S. Petri nets: Basic notions, structure, behaviour. Current Trends in Concurrency. LNCS volume 224 (1986), Springer 585-668
26. Sangiorgi D. π-calculus, internal mobility and agent passing calculi. Theoretical Computer Science 167 2 (1996) 235-271
27. Roberto Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, M.I.T., 1995
28. Segala R., and Lynch N. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2 2 (1995) 250-273 An extended abstract appears
29. Segala R., and Lynch N. Probabilistic simulations for probabilistic processes. Proceedings of 5th CONCUR. LNCS 836 (1994) 481-496
30. Stoelinga M. An introduction to probabilistic automata. Bulletin of the European Association for Theoretical Computer Science 78 (2002) 176-198
31. Varacca D., Völzer H., and Winskel G. Probabilistic event structures and domains. TCS 358 2-3 (2006) 173-199 Full version of the homonymous paper in CONCUR 2004
32. Daniele Varacca and Nobuko Yoshida. Event structures, types and the π-calculus. Technical Report 2005/06, Imperial College London, 2005. Available at www.doc.ic.ac.uk/~varacca
33. Varacca D., and Yoshida N. Typed event structures and the π-calculus. Proceedings of XXII MFPS. ENTCS volume 158 (2006), Elsevier 373-397
34. Völzer H. Randomized non-sequential processes. Proceedings of 12th CONCUR. LNCS volume 2154 (2001) 184-201 Extended version as Technical Report 02-28 - SVRC - University of Queensland
35. Winskel G. Event structure semantics for CCS and related languages. Proceedings of 9th ICALP. LNCS volume 140 (1982), Springer 561-576
36. Winskel G., and Nielsen M. Models for concurrency. Handbook of logic in Computer Science, volume 4 (1995), Clarendon Press
37. Yoshida N., Berger M., and Honda K. Strong Normalisation in the π-Calculus. Proceedings of LICS'01. IEEE (2001) 311-322 The full version in
38. Yoshida N., Berger M., and Honda K. Strong Normalisation in the π-Calculus. Journal of Information and Computation 191 (2004) 145-202 Elsevier
39. Yoshida N., Honda K., and Berger M. Linearity and bisimulation. FoSSaCs02. LNCS volume 2303 (2002), Springer 417-433