2000 character limit reached
A Decidable Characterization of a Graphical Pi-calculus with Iterators (1011.0220v1)
Published 1 Nov 2010 in cs.FL and cs.LO
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.