Equivalence Checking for a Finite Higher Order π-Calculus
DOI10.1007/978-3-540-79124-9_4zbMATH Open1138.68439OpenAlexW1509030580MaRDI QIDQ5458809FDOQ5458809
Authors: Zining Cao 
Publication date: 24 April 2008
Published in: Tests and Proofs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79124-9_4
Recommendations
- Foundations of Software Science and Computation Structures
- More on bisimulations for higher order \(\pi\)-calculus
- On Bisimulation Theory in Linear Higher-Order π-Calculus
- Contextual equivalence for higher-order \(\pi\)-calculus revisited
- Contextual equivalence for higher-order pi-calculus revisited
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Bisimulation for higher-order process calculi
- Contextual equivalence for higher-order \(\pi\)-calculus revisited
- Handbook of process algebra
- Symbolic bisimulations
- Proof systems for message-passing process algebras
- Computing bisimulations for finite-control \(\pi\)-calculus
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Algebraic theories for name-passing calculi
- Title not available (Why is that?)
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
- Plain CHOCS. A second generation calculus for higher order processes
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Equivalence Checking for a Finite Higher Order π-Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458809)
