On decidability of the bisimilarity on higher-order processes with parameterization
From MaRDI portal
Publication:6643749
DOI10.4204/EPTCS.339.8MaRDI QIDQ6643749
Publication date: 26 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- First-order reasoning for higher-order concurrency
- On the expressiveness and decidability of higher-order process calculi
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Undecidability of bisimilarity for Petri nets and some related problems
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Unique decomposition of processes
- Plain CHOCS. A second generation calculus for higher order processes
- \(\mathrm{HO}\pi\) in Coq
- The \(\pi\)-calculus: A theory of mobile processes
- On the Expressiveness of Forwarding in Higher-Order Communication
- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
- On the expressive power of recursion, replication and iteration in process calculi
- On parameterization of higher-order processes
- Parameterizing higher-order processes on names and processes
- Decidable Fragments of a Higher Order Calculus with Locations
- Global Computing
- Equivalence-checking on infinite-state systems: Techniques and results
- On decidability of the bisimilarity on higher-order processes with parameterization
Related Items (1)
This page was built for publication: On decidability of the bisimilarity on higher-order processes with parameterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643749)