Modelling and Verifying Mobile Systems Using π-Graphs
From MaRDI portal
Publication:3599092
DOI10.1007/978-3-540-95891-8_40zbMath1206.68218MaRDI QIDQ3599092
Joël-Alexis Bialkiewicz, Frédéric Peschanski
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_40
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic approach to single-pushout graph transformation
- A partition refinement algorithm for the \(\pi\)-calculus
- Three Partition Refinement Algorithms
- Time, clocks, and the ordering of events in a distributed system
- Handbook of Graph Grammars and Computing by Graph Transformation
- Graph rewriting for the π-calculus
- Processes, Terms and Cycles: Steps on the Road to Infinity