A partition refinement algorithm for the \(\pi\)-calculus

DOI10.1006/inco.2000.2895zbMath1003.68082OpenAlexW1972340458MaRDI QIDQ1854406

Marco Pistore, Davide Sangiorgi

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.2895

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Coalgebraic Symbolic Semantics ⋮ Partition refinement of component interaction automata ⋮ Modelling and Verifying Mobile Systems Using π-Graphs

Uses Software

• MWB

Cites Work

• Unnamed Item
• CCS expressions, finite state processes, and three problems of equivalence
• Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
• A calculus of mobile processes. II
• An algebraic verification of a mobile network
• Deciding bisimulation equivalences for a class of non-finite-state programs
• A theory of bisimulation for the \(\pi\)-calculus
• Three Partition Refinement Algorithms

This page was built for publication: A partition refinement algorithm for the \(\pi\)-calculus