Equivalence Checking for a Finite Higher Order π-Calculus
From MaRDI portal
Publication:5458809
Recommendations
Cites work
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 1223723 (Why is no real title available?)
- scientific article; zbMATH DE number 1223732 (Why is no real title available?)
- Algebraic theories for name-passing calculi
- Bisimulation for higher-order process calculi
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
- Computing bisimulations for finite-control \(\pi\)-calculus
- Contextual equivalence for higher-order \(\pi\)-calculus revisited
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Handbook of process algebra
- Plain CHOCS. A second generation calculus for higher order processes
- Proof systems for message-passing process algebras
- Symbolic bisimulations
Cited in
(6)- Contextual equivalence for higher-order \(\pi\)-calculus revisited
- External equality and absolute equality coincide in finite CCS and \(\pi\) calculus without summation
- CONCUR 2005 – Concurrency Theory
- scientific article; zbMATH DE number 2185678 (Why is no real title available?)
- Contextual equivalence for higher-order pi-calculus revisited
- scientific article; zbMATH DE number 6452608 (Why is no real title available?)
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)