Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Handbook of logic in computer science (vol. 4)
A multiset semantics for the pi-calculus with replication
Theoretical Computer Science - Special volume on Petri nets
Non-interleaving semantics for mobile processes
Theoretical Computer Science
Locality and True-concurrency in Calculi for Mobile Processes
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Causality and True Concurrency: A Data-flow Analysis of the Pi-Calculus (Extended Abstract)
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Reversibility and Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
Configuration structures, event structures and Petri nets
Theoretical Computer Science
Typed event structures and the linear π-calculus
Theoretical Computer Science
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Event structure semantics for nominal calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A Compositional Semantics for the Reversible p-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We give a compositional event structure semantics of the π-calculus. The main issues to deal with are the communication of free names and the extrusion of bound names. These are the source of the expressiveness of the π-calculus, but they also allow subtle forms of causal dependencies. We show that free name communications can be modeled in terms of "incomplete/potential synchronization" events. On the other hand, we argue that it is not possible to satisfactorily model parallel extrusion within the framework of stable event structures. We propose to model a process as a pair (E, X) where E is a prime event structure and X is a set of (bound) names. Intuitively, E encodes the structural causality of the process, while the set X affects the computation on E so as to capture the causal dependencies introduced by scope extrusion. The correctness of our true concurrent semantics is shown by an operational adequacy theorem with respect to the standard late semantics of the π-calculus.