Typed Event Structures and the p-Calculus

We propose a typing system for the true concurrent model of event structures that guarantees the interesting behavioural properties known as conflict freeness and confusion freeness. Conflict freeness is the true concurrent version of the notion of confluence. A system is confusion free if nondeterministic choices are localised and do not depend on the scheduling of independent components. Ours is the first typing system to control behaviour in a true concurrent model. To demonstrate its applicability, we show that typed event structures give a semantics of linearly typed version of the @p-calculi with internal mobility. The semantics we provide is the first event structure semantics of the @p-calculus and generalises Winskel's original event structure semantics of CCS.

[1]  Pierre-Louis Curien,et al.  Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..

[2]  Vladimiro Sassone,et al.  High-Level Petri Nets as Type Theories in the Join Calculus , 2001, FoSSaCS.

[3]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[4]  Peter Sewell,et al.  Models for name-passing processes: interleaving and causal , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[5]  Frank D. Valencia,et al.  On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi , 2004, FoSSaCS.

[6]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[7]  Vasco Thudichum Vasconcelos,et al.  Typed Concurrent Objects , 1994, ECOOP.

[8]  Maurizio Gabbrielli,et al.  Replication vs. Recursive Definitions in Channel Based Calculi , 2003, ICALP.

[9]  Antoni W. Mazurkiewicz,et al.  Trace Theory , 1986, Advances in Petri Nets.

[10]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[11]  Davide Sangiorgi.  Internal Mobility and Agent-Passing Calculi , 1995, ICALP.

[12]  Claudia Faggian,et al.  A Graph Abstract Machine Describing Event Structure Composition , 2007, Electron. Notes Theor. Comput. Sci..

[13]  Oltea Mihaela Herescu.  Probabilistic asynchronous π-calculus ∗ , 2000 .

[14]  Ugo Montanari,et al.  Unfolding and Event Structure Semantics for Graph Grammars , 1999, FoSSaCS.

[15]  Glynn Winskel,et al.  Events in computation , 1980 .

[16]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[17]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[18]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[19]  Davide Sangiorgi.  pi-Calculus, Internal Mobility, and Agent-Passing Calculi , 1996, Theor. Comput. Sci..

[20]  D. Sangiorgi.  - calculus , internal mobility , and agent-passing calculi , 1995 .

[21]  Jim Laird.  A Game Semantics of the Asynchronous π-Calculus , 2005 .

[22]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[23]  Joost Engelfriet.  A Multiset Semantics for the pi-Calculus with Replication , 1996, Theor. Comput. Sci..

[24]  Albert Benveniste,et al.  Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications , 2005, FoSSaCS.

[25]  Paul-André Melliès.  Asynchronous games 4: a fully complete model of propositional linear logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[26]  Glynn Winskel,et al.  Probabilistic event structures and domains , 2004, Theor. Comput. Sci..

[27]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming — CP '95 , 1995, Lecture Notes in Computer Science.

[28]  Glynn Winskel,et al.  Models for Concurrency , 1994 .

[29]  Glynn Winskel.  Relations in concurrency , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[30]  Roberto Bruni,et al.  Event Structure Semantics for Nominal Calculi , 2006, CONCUR.

[31]  Benjamin C. Pierce,et al.  Linearity and the pi-calculus , 1999, TOPL.

[32]  Claudia Faggian,et al.  Ludics nets, a game model of concurrent interaction , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[33]  Radha Jagadeesan,et al.  Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract) , 1995, AMAST.

[34]  Roberto Gorrieri,et al.  A Petri Net Semantics for pi-Calculus , 1995, CONCUR.

[35]  Steffen van Bakel,et al.  Intersection Type Assignment Systems , 1995, Theor. Comput. Sci..

[36]  Daniele Varacca,et al.  Typed Event Structures and the π-Calculus – Extended , 2022 .

[37]  Catuscia Palamidessi,et al.  Probabilistic Asynchronous pi-Calculus , 2000, FoSSaCS.

[38]  Kohei Honda,et al.  Sequentiality and the π-Calculus , 2001 .

[39]  Marco Pistore,et al.  Concurrent Semantics for the π-calculus1 1Work supported in part by Esprit Basic Research project CONFER and working group COMPUGRAPH II and by Progetto Speciale CNR “Specifica ad Alto Livelloe Verifica Formale di Sistemi Digitali”. , 1995 .

[40]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[41]  Nobuko Yoshida,et al.  Type-Based Liveness Guarantee in the Presence of Nontermination and Nondeterminism , 2002 .

[42]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

[43]  Joost Engelfriet,et al.  Elementary Net Systems , 1996, Applications and Theory of Petri Nets.

[44]  Gordon D. Plotkin,et al.  Concrete Domains , 1993, Theor. Comput. Sci..

[45]  Grzegorz Rozenberg,et al.  Petri Nets: Basic Notions, Structure, Behaviour , 1986, Current Trends in Concurrency.

[46]  Davide Sangiorgi,et al.  A fully abstract semantics for causality in the $\pi$-calculus , 1998, Acta Informatica.

[47]  Rocco De Nicola,et al.  On the consistency of 'truly concurrent' operational and denotational semantics , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[48]  Glynn Winskel.  Name generation and linearity , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[49]  Corrado Priami,et al.  Non-Interleaving Semantics for Mobile Processes , 1999, Theor. Comput. Sci..