Name
Abstract | ||
|---|---|---|
This paper presents the Pi-graphs, a visual paradigmfor 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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.4204/EPTCS.39.4 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Keywords | Field | DocType |
formal language,automata theory,garbage collection,operational semantics | Operational semantics,Programming language,Computer science,Pi calculus,Infinity,Decidability,Theoretical computer science,Bisimulation,Garbage collection,Semantics | Journal |
Volume | Issue | ISSN |
39 | 39 | 2075-2180 |
Citations | PageRank | References |
1 | 0.37 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frédéric Peschanski | 1 | 47 | 11.12 |
| Hanna Klaudel | 2 | 300 | 36.69 |
| Raymond Devillers | 3 | 742 | 76.40 |