[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Formal Languages and Automata Theory

arXiv:1011.0220v1 (cs)
[Submitted on 1 Nov 2010]

Title:A Decidable Characterization of a Graphical Pi-calculus with Iterators

Authors:Frédéric Peschanski (UPMC-LIP6), Hanna Klaudel (Université Evry-Ibisc), Raymond Devillers (Université Libre de Bruxelles)
View PDF
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.
Comments: In Proceedings INFINITY 2010, arXiv:1010.6112
Subjects: Formal Languages and Automata Theory (cs.FL); Logic in Computer Science (cs.LO)
Cite as: arXiv:1011.0220 [cs.FL]
  (or arXiv:1011.0220v1 [cs.FL] for this version)
  https://doi.org/10.48550/arXiv.1011.0220
Journal reference: EPTCS 39, 2010, pp. 47-61
Related DOI: https://doi.org/10.4204/EPTCS.39.4

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Mon, 1 Nov 2010 00:19:02 UTC (30 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.FL
< prev   |   next >
new | recent | 2010-11
Change to browse by:
cs
cs.LO

References & Citations

DBLP - CS Bibliography

listing | bibtex
Frédéric Peschanski
Hanna Klaudel
Raymond R. Devillers
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)