Modelling and Verifying Mobile Systems Using π-Graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1759443 (Why is no real title available?)
- scientific article; zbMATH DE number 2242584 (Why is no real title available?)
- A partition refinement algorithm for the -calculus
- Algebraic approach to single-pushout graph transformation
- Graph rewriting for the π-calculus
- Handbook of Graph Grammars and Computing by Graph Transformation
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Three Partition Refinement Algorithms
- Time, clocks, and the ordering of events in a distributed system
Cited in
(5)- A semiring-based quantitative analysis of mobile systems
- Graphical Encoding of a Spatial Logic for the π-Calculus
- A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).
- Graphical verification of a spatial logic for the {\(\pi\)}-calculus
- A Petri net interpretation of open reconfigurable systems
This page was built for publication: Modelling and Verifying Mobile Systems Using π-Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599092)