Add to ORKGInternational audienceIn this paper, we propose a finite structural translation of possibly recursive $pi$-calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded
We develop a polynomial translation from finite control pi-calculus processesto safe low-level Petri...
We introduce a spatio-temporal logic PSTL defined on Pi-Calculus processes. This logic is especially...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
International audienceWe propose a finite structural translation of possibly recursive π-calculus te...
In this paper, we propose a finite structural translation of possibly recursive π-calculus terms int...
We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. T...
International audienceIn this paper we propose a translation into high-level Petri nets of the terms...
In this paper, we propose a finite representation of recur sively defined Petri nets in the framewor...
In this paper we propose a translation into high level Petri nets of a finite fragment of the π-calc...
International audienceWe present a Petri net interpretation of the pi-graphs - a graphical variant o...
Abstract. We present a Petri net interpretation of the pi-graphs- a graphical variant of the pi-calc...
We present a Petri net interpretation of the pi-graphs - a graphical variant of the pi-calculus. Cha...
International audienceWe present a Petri net interpretation of the pi-graphs - a graphical variant o...
AbstractA multiset (or Petri net) semantics is defined for the π-calculus with replication. The sema...
In this paper we investigate the -calculus guards, proposing a formalism which use exclusively machi...
We develop a polynomial translation from finite control pi-calculus processesto safe low-level Petri...
We introduce a spatio-temporal logic PSTL defined on Pi-Calculus processes. This logic is especially...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...
International audienceWe propose a finite structural translation of possibly recursive π-calculus te...
In this paper, we propose a finite structural translation of possibly recursive π-calculus terms int...
We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. T...
International audienceIn this paper we propose a translation into high-level Petri nets of the terms...
In this paper, we propose a finite representation of recur sively defined Petri nets in the framewor...
In this paper we propose a translation into high level Petri nets of a finite fragment of the π-calc...
International audienceWe present a Petri net interpretation of the pi-graphs - a graphical variant o...
Abstract. We present a Petri net interpretation of the pi-graphs- a graphical variant of the pi-calc...
We present a Petri net interpretation of the pi-graphs - a graphical variant of the pi-calculus. Cha...
International audienceWe present a Petri net interpretation of the pi-graphs - a graphical variant o...
AbstractA multiset (or Petri net) semantics is defined for the π-calculus with replication. The sema...
In this paper we investigate the -calculus guards, proposing a formalism which use exclusively machi...
We develop a polynomial translation from finite control pi-calculus processesto safe low-level Petri...
We introduce a spatio-temporal logic PSTL defined on Pi-Calculus processes. This logic is especially...
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, ...