Typed Event Structures and the π-Calculus. Extended Abstract

Electronic Notes in Theoretical Computer Science

Volumn 158, Issue 1, 2006, Pages 373-397

  Varacca, Daniele ^a   Yoshida, Nobuko ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

calculus; Event structures; linearity; types

Indexed keywords

BEHAVIORAL RESEARCH; INDEPENDENT COMPONENT ANALYSIS; SCHEDULING; SEMANTICS;

EVENT STRUCTURES; LINEARITY; PI-CALCULUS; TYPES;

DIFFERENTIATION (CALCULUS);

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

References (39)

1. Abbes S., and Benveniste A. Branching cells as local states for event structures and nets: Probabilistic applications. Proceedings of 8th FoSSaCS. LNCS volume 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 volume 1578 (1999), Springer 73-89
3. Berger M., Honda K., and Yoshida N. Sequentiality and the π-calculus. Procceedingss of TLCA'01. LNCS volume 2044 (2001) 29-45
4. Berry G., and Curien P.-L. Sequential algorithms on concrete data structures. Theoretical Computer Science 20 (1982) 265-321
5. Boreale M., and Sangiorgi D. A fully abstract semantics for causality in the π-calculus. Acta Inf. 35 5 (1998) 353-400
6. Buscemi M.G., and Sassone V. High-level petri nets as type theories in the join calculus. Proceedings of 4th FOSSACS. LNCS volume 2030 (2001), Springer 104-120
7. Busi N., and Gorrieri R. A petri net semantics for pi-calculus. Proceedings of 6th CONCUR. Lecture Notes in Computer Science volume 962 (1995), Springer 145-159
8. G.L. Cattani and P. Sewell. Models for name-passing processes: Interleaving and causal. In Proceedings of 15th LICS, pages 322-332, 2000
9. P. Degano, R. De Nicola, and U. Montanari. On the consistency of "truly concurrent" operational and denotational semantics (extended abstract). In Proceedings of 3rd LICS, pages 133-141, 1988
10. Degano P., and Priami C. Non-interleaving semantics for mobile processes. Theoretical Computer Science 216 1-2 (1999) 237-270
11. Desel J., and Esparza J. Free Choice Petri Nets (1995), Cambridge University Press
12. Engelfriet J. A multiset semantics for the pi-calculus with replication. Theoretical Computer Science 153 1&2 (1996) 65-94
13. C. Faggian and F. Maurel. Ludics nets, a game model of concurrent interaction. In Proceedings of 20th LICS, pages 376-385, 2005
14. Herescu M., and Palamidessi C. Probabilistic asynchronous π-calculus. Proceedings of 3rd FoSSaCS. LNCS volume 1784 (2000), Springer 146-160
15. Honda K., and Yoshida N. On reduction-based process semantics. TCS 151 2 (1995) 385-435
16. 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 volume 936 (1995), Springer 277-291
17. Kahn G., and Plotkin G.D. Concrete domains. Theoretical Computer Science 121 1-2 (1993) 187-277
18. Mazurkiewicz A. Trace theory. Petri Nets: Applications and Relationships to Other Models of Concurrency. LNCS volume 255 (1986), Springer 279-324
19. P.-A. Melliès. Asynchronous games 4: A fully complete model of propositional linear logic. In Proceedings of 20th LICS, pages 386-395, 2005
20. Milner R. Communication and Concurrency (1989), Prentice Hall
21. Milner R. Communicating and Mobile Systems: The Pi Calculus (1999), Cambridge University Press
22. Montanari U., and Pistore M. Concurrent semantics for the π-calculus. Electr. Notes Theor. Comput. Sci. 1 (1995)
23. Nielsen M., Plotkin G.D., and Winskel G. Petri nets, event structures and domains, part I. Theoretical Computer Science 13 1 (1981) 85-108
24. Rozenberg G., and Engelfriet J. Elementary net systems. Dagstuhl Lecturs on Petri Nets. LNCS volume 1491 (1996), Springer 12-121
25. Rozenberg G., and Thiagarajan P. 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. Varacca D., Völzer H., and Winskel G. Probabilistic event structures and domains. Proceedings of 15th CONCUR. LNCS volume 3170 (2004), Springer 481-496
28. D. Varacca and N. Yoshida. Event structures, types and the π-calculus. Technical Report 2005/06, Imperial College London, 2005
29. Available at. www.doc.ic.ac.uk/~varacca
30. Vasconcelos V. Typed concurrent objects. Proc. ECOOP'94. Lecture Notes in Computer Science volume 821 (1994), Springer 100-117
31. G. Winskel. Events in Computation. Ph.D. thesis, Dept. of Computer Science, University of Edinburgh, 1980
32. Winskel G. Event structure semantics for CCS and related languages. Proceedings of 9th ICALP. LNCS volume 140 (1982), Springer 561-576
33. Winskel G. Event structures. Advances in Petri Nets 1986, Part II; Proceedings of an Advanced Course. LNCS volume 255 (1987), Springer 325-392
34. Winskel G. Name generation and linearity. Proceedings of 20th LICS (2005), IEEE Computer Society 301-310
35. Winskel G. Relations in concurrency. Proceedings of 20th LICS (2005), IEEE Computer Society 2-11
36. Winskel G., and Nielsen M. Models for concurrency. Handbook of logic in Computer Science, volume 4 (1995), Clarendon Press
37. N. Yoshida. Type-based liveness guarantee in the presence of nontermination and nondeterminism. Technical Report 2002-20, MCS Technical Report, University of Leicester, 2002
38. Yoshida N., Berger M., and Honda K. Strong Normalisation in the π-Calculus. Proceedings of LICS'01 (2001), IEEE 311-322 The full version in
39. Yoshida N., Berger M., and Honda K. Strong Normalisation in the π-Calculus. Journal of Inf. & Comp. 191 (2004) 145-202 Elsevier