AbstractWe 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 π-calculi with internal mobility. The semantics we provide is the first event structure semantics of the π-calculus and generalises Winskel's origin...
A new set of inference rules for the guarded version of Milner’s Calculus of Communicating Systems i...
AbstractWe introduce three notions of computation for processes described as CCS (Calculus of Commun...
AbstractMany different notions of “program property”, and many different methods of verifying such p...
AbstractWe propose a typing system for the true concurrent model of event structures that guarantees...
International audienceWe propose a typing system for the true concurrent model of event structures t...
We propose a typing system for the true concurrent model of event structures that guarantees an inte...
We give a compositional event structure semantics of the \u3c0-calculus. The main issues to deal wit...
Proposes a typed calculus of synchronous processes based on the structure of interaction categories....
Concurrency primitives play an important role in describing programs on parallel /distributed enviro...
AbstractCategory theory has proved a useful tool in the study of type systems for sequential program...
AbstractSession types describe the interactions between two parties within multi-party communication...
AbstractWe obtain a new formalism for concurrent object-oriented languages by extending Abadi and Ca...
Abstract. Session types are widely accepted as an expressive discipline for structuring communicatio...
We explore the role of types in models of concurrent computation, particularly in the concrete setti...
A methodology is introduced for defining truly concurrent semantics of processes as equivalence clas...
A new set of inference rules for the guarded version of Milner’s Calculus of Communicating Systems i...
AbstractWe introduce three notions of computation for processes described as CCS (Calculus of Commun...
AbstractMany different notions of “program property”, and many different methods of verifying such p...
AbstractWe propose a typing system for the true concurrent model of event structures that guarantees...
International audienceWe propose a typing system for the true concurrent model of event structures t...
We propose a typing system for the true concurrent model of event structures that guarantees an inte...
We give a compositional event structure semantics of the \u3c0-calculus. The main issues to deal wit...
Proposes a typed calculus of synchronous processes based on the structure of interaction categories....
Concurrency primitives play an important role in describing programs on parallel /distributed enviro...
AbstractCategory theory has proved a useful tool in the study of type systems for sequential program...
AbstractSession types describe the interactions between two parties within multi-party communication...
AbstractWe obtain a new formalism for concurrent object-oriented languages by extending Abadi and Ca...
Abstract. Session types are widely accepted as an expressive discipline for structuring communicatio...
We explore the role of types in models of concurrent computation, particularly in the concrete setti...
A methodology is introduced for defining truly concurrent semantics of processes as equivalence clas...
A new set of inference rules for the guarded version of Milner’s Calculus of Communicating Systems i...
AbstractWe introduce three notions of computation for processes described as CCS (Calculus of Commun...
AbstractMany different notions of “program property”, and many different methods of verifying such p...