A Decidable Characterization of a Graphical Pi-calculus with Iterators

Frédéric Peschanski 1 Hanna Klaudel 2 Raymond Devillers 3
1 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
Abstract : This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to express non-terminating behaviors. The operational semantics of Pi-graphs use ground notions of labelled transition and bisimulation, which means standard verification techniques can be applied. We show that bisimilarity is decidable for the proposed semantics, a result obtained thanks to an original notion of causal clock as well as the automatic garbage collection of unused names.
Complete list of metadatas

Contributor : Frédéric Peschanski <>
Submitted on : Monday, October 3, 2011 - 2:49:51 PM
Last modification on : Thursday, March 21, 2019 - 1:09:38 PM

Links full text



Frédéric Peschanski, Hanna Klaudel, Raymond Devillers. A Decidable Characterization of a Graphical Pi-calculus with Iterators. 12th International Workshop on Verification of Infinite-State Systems (INFINITY 2010), Sep 2010, Singapore, Singapore. pp.47--61, ⟨10.4204/EPTCS.39.4⟩. ⟨hal-00628499⟩



Record views