On the decidability of process equivalences for the \(\pi\)-calculus
From MaRDI portal
Publication:1391099
DOI10.1016/S0304-3975(96)00325-8zbMath0901.68033OpenAlexW1965072559WikidataQ56019901 ScholiaQ56019901MaRDI QIDQ1391099
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00325-8
Related Items
Bisimilar and logically equivalent programs in PDL, Symbolic transition graph and its early bisimulation checking algorithms for the \(\pi\)-calculus, On process rate semantics, Unnamed Item, Decidable Fragments of a Higher Order Calculus with Locations, A process calculus for mobile ad hoc networks
Cites Work
- Symbolic bisimulations
- Modal logics for mobile processes
- CCS expressions, finite state processes, and three problems of equivalence
- A calculus of mobile processes. II
- An algebraic verification of a mobile network
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Model checking mobile processes
- Objects in the \(\pi\)-calculus
- Three Partition Refinement Algorithms
- Functions as processes
- From π-calculus to higher-order π-calculus — and back