A Decidable Characterization of a Graphical Pi-calculus with Iterators
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...
Main Authors: | Raymond Devillers, Hanna Klaudel, Frédéric Peschanski |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-10-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1011.0220v1 |
Similar Items
-
λ-Calculus and Decidability
by: Larsson, Erik
Published: (2017) -
On the decidability of monadic first order logic in sequent calculus
by: Jean-Baptiste Joinet
Published: (2016-12-01) -
Pi+-Calculus: A Calculus for Concurrent Processes with Constraints
by: Juan Francisco Diaz, et al.
Published: (1998-12-01) -
Deciding set-theoretic formulae with the predicate 'finite' by a tableau calculus
by: Domenico Cantone, et al.
Published: (1995-11-01) -
Matching in the Pi-Calculus
by: Kirstin Peters, et al.
Published: (2014-08-01)