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
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
Non-interleaving semantics for mobile processes
Theoretical Computer Science
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
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
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
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A Graph Abstract Machine Describing Event Structure Composition
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Ludics is a model for the finitary linear pi-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Event structure semantics for nominal calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Control Encapsulation: A Calculus for Exogenous Composition of Software Components
CBSE '09 Proceedings of the 12th International Symposium on Component-Based Software Engineering
Typed event structures and the linear π-calculus
Theoretical Computer Science
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Event structure semantics of parallel extrusion in the pi-calculus
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
We propose the first compositional event structure semantics for a very expressive p-calculus, generalising Winskel's event structures for CCS. The p-calculus we model is the pI-calculus with recursive definitions and summations. First we model the synchronous calculus, introducing a notion of dynamic renaming to the standard operators on event structures. Then we model the asynchronous calculus, for which a new additional operator, called rooting, is necessary for representing causality due to new name binding. The semantics are shown to be operationally adequate and sound with respect to bisimulation.