Decidability of bisimulation equivalence for process generating context-free languages
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4035115
- Actions speak louder than words: proving bisimilarity for context-free processes
- Bisimulation equivalence is decidable for all context-free processes
- Fast equivalence-checking for normed context-free processes
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
Cited in
(60)- A note on an expressiveness hierarchy for multi-exit iteration
- The undecidability of form equivalence for context-free and EOL forms
- The context-freeness of the languages associated with vector addition systems is decidable
- A complete equational axiomatization for MPA with string iteration
- Decidability of bisimulation equivalence for normed pushdown processes
- Context-free event domains are recognizable
- A note on the complexity of deciding bisimilarity of normed unary processes
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- An equational axiomatization for multi-exit iteration
- The complexity of bisimilarity-checking for one-counter processes.
- Effective decomposability of sequential behaviours
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Algebraically complete semirings and Greibach normal form
- Decidability of bisimilarity for one-counter processes.
- Bisimilarity on basic parallel processes
- Equivalence of pushdown automata via first-order grammars
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
- A general approach to comparing infinite-state systems with their finite-state specifications
- Decidable first-order transition logics for PA-processes
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
- Model-checking games for typed -calculi
- Regular strategies as proof tactics for \textsf{CIRC}
- Fast equivalence-checking for normed context-free processes
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity
- A Context-Free Process as a Pushdown Automaton
- On the Expressive Power of Restriction and Priorities in CCS with Replication
- scientific article; zbMATH DE number 4035115 (Why is no real title available?)
- Actions speak louder than words: proving bisimilarity for context-free processes
- scientific article; zbMATH DE number 1226054 (Why is no real title available?)
- scientific article; zbMATH DE number 1231553 (Why is no real title available?)
- Bisimulation equivalence is decidable for one-counter processes
- Axiomatizations for the perpetual loop in process algebra
- Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence.
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
- scientific article; zbMATH DE number 2102747 (Why is no real title available?)
- Sequential composition in the presence of intermediate termination (extended abstract)
- Two lower bounds for BPA
- Deciding the bisimilarity of context-free session types
- Bisimulation Equivalence of First-Order Grammars
- Reflections on a Geometry of Processes
- Decidability of weak bisimilarity for a subset of BPA
- Pushdown Automata and Context-Free Grammars in Bisimulation Semantics
- Pushdown automata, multiset automata, and Petri nets
- Deciding bisimulation-like equivalences with finite-state processes
- Linearization in parallel pCRL
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
- Non-regular iterators in process algebra
- Basic process algebra with deadlocking states
- Nested semantics over finite trees are equationally hard
- Infinite results
- Decidability of bisimulation equivalence for normed pushdown processes
- Polymorphic higher-order context-free session types
- System \(F^\mu_\omega\) with context-free session types
- Decidability results in automata and process theory
- Subtyping context-free session types
- Bisimulation equivalence of pushdown automata is Ackermann-complete
- Subtyping context-free session types
- On the computational complexity of bisimulation, redux
- Bisimilarity is not finitely based over BPA with interrupt
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
This page was built for publication: Decidability of bisimulation equivalence for process generating context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140021)
