Add to ORKGInternational audienceIn this paper we propose a translation into high-level Petri nets of the terms of a finite fragment of the $\pi$-calculus. Our construction renders in a compositional way the control flow aspects present in $\pi$-calculus process expressions, by adapting the existing graph-theoretic net composition operators. Those aspects which are related to term rewriting, as well as name binding, are handled through special inscriptions of places, transitions and arcs, together with a suitable choice of the initial marking
none2We clarify the relationship between picalc and finite p/t Petri nets. The first insight is that...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
We present a Petri net interpretation of the pi-graphs - a graphical variant of the pi-calculus. Cha...
In this paper we propose a translation into high level Petri nets of a finite fragment of the π-calc...
International audienceIn this paper, we propose a finite structural translation of possibly recursiv...
International audienceWe propose a finite structural translation of possibly recursive π-calculus te...
We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. T...
In this paper, we propose a finite structural translation of possibly recursive π-calculus terms int...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
We introduce the calculus Multi-CCS, which extends conservatively CCS with an operator of strong pre...
We introduce the calculus Multi-CCS, which extends conservatively CCS with an operator of strong pre...
We introduce the calculus Multi-CCS, which extends conservatively CCS with an operator of strong pre...
Finite-net Multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
Finite-net Multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
none2We clarify the relationship between picalc and finite p/t Petri nets. The first insight is that...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
We present a Petri net interpretation of the pi-graphs - a graphical variant of the pi-calculus. Cha...
In this paper we propose a translation into high level Petri nets of a finite fragment of the π-calc...
International audienceIn this paper, we propose a finite structural translation of possibly recursiv...
International audienceWe propose a finite structural translation of possibly recursive π-calculus te...
We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. T...
In this paper, we propose a finite structural translation of possibly recursive π-calculus terms int...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
We introduce the calculus Multi-CCS, which extends conservatively CCS with an operator of strong pre...
We introduce the calculus Multi-CCS, which extends conservatively CCS with an operator of strong pre...
We introduce the calculus Multi-CCS, which extends conservatively CCS with an operator of strong pre...
Finite-net Multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
Finite-net Multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
none2We clarify the relationship between picalc and finite p/t Petri nets. The first insight is that...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
We present a Petri net interpretation of the pi-graphs - a graphical variant of the pi-calculus. Cha...