HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Modelling and Verifying Mobile Systems Using Pi-Graphs

Frédéric Peschanski 1 Joël-Alexis Bialkiewicz 2
1 SMA - Systèmes Multi-Agents
LIP6 - Laboratoire d'Informatique de Paris 6
2 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper introduces the π-graphs, a graphical model of mobile interactions that tries to accommodate the expressivity of the π-calculus and the intuitiveness of place-transition nets. Graph rewriting techniques are used to describe the operational semantics of π-graphs. The bijective encoding/decoding of π-graphs allows to mix transparently graphical and term-based proof techniques, which leads to a dual characterization of bisimilarity. The main originality of this characterization is the synchronous interpretation it provides: each graph/term being attached to a clock evolving at the rate of interactions with the environment. This gives new opportunities for the design of efficient verification algorithms for mobile systems.
Document type :
Conference papers
Complete list of metadata

Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Monday, April 4, 2016 - 11:57:14 AM
Last modification on : Friday, January 8, 2021 - 5:50:04 PM

Links full text



Frédéric Peschanski, Joël-Alexis Bialkiewicz. Modelling and Verifying Mobile Systems Using Pi-Graphs. 35th International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 2009), Jan 2009, Špindlerův Mlýn, Czech Republic. pp.437-442, ⟨10.1007/978-3-540-95891-8_40⟩. ⟨hal-01297406⟩



Record views