Decidability of weak bisimilarity for a subset of basic parallel processes
From MaRDI portal
Recommendations
- Decidability of weak bisimilarity for a subset of BPA
- More on Weak Bisimilarity of Normed Basic Parallel Processes
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
- Undecidable equivalences for basic parallel processes
- Undecidability of weak bisimilarity for PA-processes
Cited in
(38)- On modal \(\mu \)-calculus and Gödel-Löb logic
- Non-interleaving bisimulation equivalences on basic parallel processes
- A short proof of the decidability of bisimulation for normed BPA- processes
- Decidability of bisimilarity for one-counter processes.
- Observational interpretations of hybrid dynamic logic with binders and silent transitions
- Decidability of branching bisimulation on normed commutative context-free processes
- Logical characterisations, rule formats and compositionality for input-output conformance simulation
- Analysis of meeting protocols by formalisation, simulation, and verification
- Decidability of performance equivalence for basic parallel processes
- Modifications of expansion trees for weak bisimulation in BPA
- Refining the undecidability border of weak bisimilarity
- Systems modelling via resources and processes: philosophy, calculus, semantics, and logic
- Decidability of branching bisimulation on normed commutative context-free processes
- More on Weak Bisimilarity of Normed Basic Parallel Processes
- Deciding Bisimilarity of Full BPA Processes Locally
- scientific article; zbMATH DE number 1232246 (Why is no real title available?)
- Undecidability of weak bisimilarity for PA-processes
- Decidability of strong bisimilarity for timed BPP
- Undecidability of weak bisimilarity for pushdown processes
- Undecidable equivalences for basic parallel processes
- Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard
- Approximating weak bisimulation on basic process algebras
- Approximating weak bisimilarity of basic parallel processes
- Inference Systems with Corules for Combined Safety and Liveness Properties of Binary Session Types
- Branching bisimilarity checking for PRS
- Parity Games and Propositional Proofs
- Normed processes, unique decomposition, and complexity of bisimulation equivalences
- Differential game logic
- Checking equality and regularity for normed BPA with silent moves
- Decidability of weak bisimilarity for a subset of BPA
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
- Weak bisimulation and model checking for basic parallel processes
- On the computational complexity of bisimulation, redux
- Behavioural and abstractor specifications revisited
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- A calculus and logic of resources and processes
- A timed semantics of Orc
- Algebra and logic for access control
This page was built for publication: Decidability of weak bisimilarity for a subset of basic parallel processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2769443)
