Petri nets: basic notions, structure, behaviour
Current trends in concurrency. Overviews and tutorials
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Free choice Petri nets
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
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
Non-interleaving semantics for mobile processes
Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
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
ECOOP '94 Proceedings of the 8th 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
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Strong normalisation in the π-calculus
Information and Computation
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Ludics Nets, a game Model of Concurrent Interaction
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic
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
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Concurrent and Located Synchronizations in π-Calculus
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Partial Orders, Event Structures and Linear Strategies
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Typed event structures and the linear π-calculus
Theoretical Computer Science
A nice labelling for tree-like event structures of degree 3
Information and Computation
A nice labelling for tree-like event structures of degree 3
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 0.01 |
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.