Typed event structures and the linear π-calculus

Theoretical Computer Science

Volumn 411, Issue 19, 2010, Pages 1949-1973

  Varacca, Daniele ^a   Yoshida, Nobuko ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Confusion freeness; Event structures; Linearity; Types; calculus

Indexed keywords

BIOMINERALIZATION; CONCURRENCY CONTROL; SEMANTICS;

CONCURRENT MODELING; CONFUSION FREENESS; EVENT STRUCTURES; INDEPENDENT COMPONENTS; INTERNAL MOBILITY; LINEARITY; NONDETERMINISTIC CHOICE; TYPES;

CALCULATIONS;

EID: 77949541911     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.01.024     Document Type: Article

References (47)

1. Abbes S., and Benveniste A. Branching cells as local states for event structures and nets: Probabilistic applications. Proceedings of 8th FoSSaCS. LNCS vol. 3441 (2005), Springer 95-109
2. Baldan P., Corradini A., and Montanari U. Unfolding and event structure semantics for graph grammars. Proceedings of 2nd FoSSaCS. LNCS vol. 1578 (1999), Springer 73-89
3. Berger M., Honda K., and Yoshida N. Sequentiality and the π-calculus. Procceedingss of TLCA'01. LNCS vol. 2044 (2001) 29-45
4. Berry G., and Curien P.-L. Sequential algorithms on concrete data structures. Theoretical Computer Science 20 265-321 (1982)
5. Boreale M., and Sangiorgi D. A fully abstract semantics for causality in the π-calculus. Acta Informatica 35 5 (1998) 353-400
6. Bruni R., Melgratti H., and Montaari U. Event structure semantics for nominal calculi. Proceedings of 17th CONCUR. LNCS vol. 4137 (2006), Springer 295-309
7. Buscemi M.G., and Sassone V. High-level petri nets as type theories in the join calculus. Proceedings of 4th FOSSACS. LNCS vol. 2030 (2001), Springer 104-120
8. Busi N., Gabbrielli M., and Zavattaro G. Replication vs. recursive definitions in channel based calculi. Proceedings of 30th ICALP. LNCS vol. 2719 (2003), Springer 133-144
9. Busi N., and Gorrieri R. A petri net semantics for pi-calculus. Proceedings of 6th CONCUR. Lecture Notes in Computer Science vol. 962 (1995), Springer 145-159
10. Gian Luca Cattani, Peter Sewell, Models for name-passing processes: Interleaving and causal, in: Proceedings of 15th LICS, 2000, pp. 322-332.
11. 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. LNCS vol. 3705 (2005), Springer
12. Crafa S., Varacca D., and Yoshida N. Compositional event structure semantics for the internal pi-calculus. Proceedings of 18th CONCUR. LNCS vol. 4703 (2007), Springer 317-332
13. Pierpaolo Degano, Rocco De Nicola, Ugo Montanari, On the consistency of truly concurrent operational and denotational semantics (extended abstract), in: Proceedings of 3rd LICS, 1988, pp. 133-141.
14. Degano P., and Priami C. Non-interleaving semantics for mobile processes. Theoretical Computer Science 216 1-2 (1999) 237-270
15. Desel J., and Esparza J. Free Choice Petri Nets (1995), Cambridge University Press
16. Engelfriet J. A multiset semantics for the pi-calculus with replication. Theoretical Computer Science 153 1&2 (1996) 65-94
17. Claudia Faggian, François Maurel, Ludics nets, a game model of concurrent interaction, in: Proceedings of 20th LICS, 2005, pp. 376-385.
18. Faggian C., and Piccolo M. A graph abstract machine describing event structure composition. Proceedings of the workshop GT-VC 06. Electronic Notes on Theoretical Computer Science vol. 175:4 (2007) 21-36
19. Faggian C., and Piccolo M. Ludics is a model for the finitary linear pi-calculus. Proceedings of 8th TLCA 2007. LNCS vol. 4583 (2007), Springer 148-162
20. Giambiagi P., Schneider G., and Valencia F.D. On the expressiveness of infinite behavior and name scoping in process calculi. Proceedings of 7th FoSSaCS. LNCS vol. 2987 (2004), Springer 226-240
21. Herescu M., and Palamidessi C. Probabilistic asynchronous π-calculus. Proceedings of 3rd FoSSaCS. LNCS vol. 1784 (2000), Springer 146-160
22. Kohei Honda, Olivier Laurent, An exact correspondence between a typed pi-calculus and polarised proof-nets, Theoretical Computer Science (2010), in press (doi:10.1016/j.tcs.2010.01.028).
23. Honda K., and Yoshida N. On reduction-based process semantics. Theoretical Computer Science 151 2 (1995) 385-435
24. Jagadeesan L.J., and Jagadeesan R. Causality and true concurrency: A data-flow analysis of the pi-calculus (extended abstract). Proceedings of 4th AMAST. LNCS vol. 936 (1995), Springer 277-291
25. Kahn G., and Plotkin G.D. Concrete domains. Theoretical Computer Science 121 1-2 (1993) 187-277
26. Mazurkiewicz A. Trace theory. Petri Nets: Applications and Relationships to Other Models of Concurrency. LNCS vol. 255 (1986), Springer 279-324
27. Paul-André Melliès, Asynchronous games 4: A fully complete model of propositional linear logic, in: Proceedings of 20th LICS, 2005, pp. 386-395.
28. Milner R. Communication and Concurrency (1989), Prentice Hall
29. Milner R. Communicating and Mobile Systems: The Pi Calculus (1999), Cambridge University Press
30. Montanari U., and Pistore M. Concurrent semantics for the π-calculus. Electronic Notes on Theoretical Computer Science 1 (1995)
31. Nielsen M., Plotkin G.D., and Winskel G. Petri nets, event structures and domains, part I. Theoretical Computer Science 13 1 (1981) 85-108
32. Rozenberg G., and Engelfriet J. Elementary net systems. Dagstuhl Lecturs on Petri Nets. LNCS vol. 1491 (1996), Springer 12-121
33. Rozenberg G., and Thiagarajan P.S. Petri nets: Basic notions, structure, behaviour. Current Trends in Concurrency. LNCS vol. 224 (1986), Springer 585-668
34. Sangiorgi D. π-calculus, internal mobility and agent passing calculi. Theoretical Computer Science 167 2 (1996) 235-271
35. Varacca D., Völzer H., and Winskel G. Probabilistic event structures and domains. Proceedings of 15th CONCUR. LNCS vol. 3170 (2004), Springer 481-496 (A full version appeared in Theoretical Computer Science, 358(2-3):173-199, 2006)
36. Varacca D., Völzer H., and Winskel G. Probabilistic event structures and domains. Theoretical Computer Science 358 2-3 (2006) 173-199 (Full version of a paper published in CONCUR 2004)
37. Daniele Varacca, Nobuko Yoshida, Typed event structures and the π-calculus, in: Proceedings of XXII MFPS, ENTCS, 2006.
38. Varacca D., and Yoshida N. Probabilistic pi-calculus and event structures. Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages, QAPL 2007. Electronic Notes on Theoretical Computer Science vol. 190:3 (2007) 147-166
39. Vasconcelos V. Typed concurrent objects. Proc.ECOOP'94. Lecture Notes in Computer Science vol. 821 (1994), Springer 100-117
40. Glynn Winskel, Events in Computation. Ph.D. Thesis, Dept. of Computer Science, University of Edinburgh, 1980.
41. Winskel G. Event structure semantics for CCS and related languages. Proceedings of 9th ICALP. LNCS vol. 140 (1982), Springer 561-576
42. Winskel G. Event structures. Advances in Petri Nets 1986 Part II; Proceedings of an Advanced Course. LNCS vol. 255 (1987), Springer 325-392
43. Winskel G. Name generation and linearity. Proceedings of 20th LICS (2005), IEEE Computer Society 301-310
44. Winskel G. Relations in concurrency. Proceedings of 20th LICS (2005), IEEE Computer Society 2-11
45. Winskel G., and Nielsen M. Models for concurrency. Handbook of Logic in Computer Science vol. 4 (1995), Clarendon Press
46. Nobuko Yoshida, Type-based liveness guarantee in the presence of nontermination and nondeterminism. Technical Report 2002-20, MCS Technical Report, University of Leicester, 2002.
47. Yoshida N., Berger M., and Honda K. Strong Normalisation in the π-Calculus. Proceedings of LICS'01 (2001), IEEE 311-322 (The full version in Journal of Inf. & Comp., 191 (2004) 145-202, Elsevier)