Accepté à CONCUR 2007International audienceWe propose the first compositional event structure semantics for a fully expressive pi-calculus, generalising Winskel's event structures for CCS. The pi-calculus we model is the piI-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
We propose a typing system for the true concurrent model of event structures that guarantees an inte...
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model ...
) Lalita Jategaonkar Jagadeesan Software Production Research Dept. AT&T Bell Laboratories Naperv...
Abstract. We propose the first compositional event structure semantics for a very expressive pi-calc...
We propose the first compositional event structure semantics for a very expressive pi-calculus, gene...
Abstract. We give a compositional event structure semantics of the pi-calculus. The main issues to d...
We give a compositional event structure semantics of the \u3c0-calculus. The main issues to deal wit...
We give the first non-interleaving early operational semantics for the pi-calculus which generalizes...
We provide a non-interleaving operational semantics for the pi-calculus as asynchronous transition s...
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...
Accepté pour le workshop QAPL 2007, associé à ETAPSInternational audienceThis paper proposes two sem...
International audienceWe introduce a labelled transition semantics for the reversible pi-calculus. I...
This paper proposes two semantics of a probabilistic variant of the pi-calculus: an interleaving sem...
We give denotational semantics to a wide range of parallel programming languages based on the ideas ...
We propose a typing system for the true concurrent model of event structures that guarantees an inte...
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model ...
) Lalita Jategaonkar Jagadeesan Software Production Research Dept. AT&T Bell Laboratories Naperv...
Abstract. We propose the first compositional event structure semantics for a very expressive pi-calc...
We propose the first compositional event structure semantics for a very expressive pi-calculus, gene...
Abstract. We give a compositional event structure semantics of the pi-calculus. The main issues to d...
We give a compositional event structure semantics of the \u3c0-calculus. The main issues to deal wit...
We give the first non-interleaving early operational semantics for the pi-calculus which generalizes...
We provide a non-interleaving operational semantics for the pi-calculus as asynchronous transition s...
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...
Accepté pour le workshop QAPL 2007, associé à ETAPSInternational audienceThis paper proposes two sem...
International audienceWe introduce a labelled transition semantics for the reversible pi-calculus. I...
This paper proposes two semantics of a probabilistic variant of the pi-calculus: an interleaving sem...
We give denotational semantics to a wide range of parallel programming languages based on the ideas ...
We propose a typing system for the true concurrent model of event structures that guarantees an inte...
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model ...
) Lalita Jategaonkar Jagadeesan Software Production Research Dept. AT&T Bell Laboratories Naperv...