Bisimulation equivalence is decidable for all context-free processes
From MaRDI portal
Publication:1899906
DOI10.1006/inco.1995.1129zbMath0833.68074OpenAlexW1965551437MaRDI QIDQ1899906
Publication date: 11 March 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/65a62078c24f749d2faaf01462982a5872050dcf
Related Items
Petri nets, commutative context-free grammars, and basic parallel processes, Partially-Commutative Context-Free Processes, Undecidable equivalences for basic parallel processes, Nested semantics over finite trees are equationally hard, Bisimulation equivalence is decidable for one-counter processes, A generic framework for checking semantic equivalences between pushdown automata and finite-state automata, On the decidability of process equivalences for the π-calculus, High undecidability of weak bisimilarity for Petri nets, Infinite results, The complexity of bisimilarity-checking for one-counter processes., Product line process theory, Undecidability of domino games and hhp-bisimilarity., An algebra of behavioural types, Constrained properties, semilinear systems, and Petri nets, Selected Ideas Used for Decidability and Undecidability of Bisimilarity, Deciding Bisimilarity of Full BPA Processes Locally, Deciding properties of integral relational automata, Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity, Deciding bisimulation and trace equivalences for systems with many identical processes, Decidability of bisimulation equivalence for normed pushdown processes, Deciding the Bisimilarity of Context-Free Session Types, Complexity of Weak Bisimilarity and Regularity for BPA and BPP, Decidability of Weak Bisimilarity for a Subset of BPA, Partially-commutative context-free processes: expressibility and tractability, On the computational complexity of bisimulation, redux, Decidability of DPDA equivalence, Pushdown automata, multiset automata, and Petri nets, Deciding bisimulation-like equivalences with finite-state processes, On the complexity of checking semantic equivalences between pushdown processes and finite-state processes, Bisimulation and coinduction enhancements: a historical perspective, Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time, Basic process algebra with deadlocking states, Decidability of bisimulation equivalence for normed pushdown processes, Decidability of bisimilarity for one-counter processes., Simulation preorder over simple process algebras, Reflections on a Geometry of Processes, Polymorphic lambda calculus with context-free session types
