Pages that link to "Item:Q1899906"

The following pages link to Bisimulation equivalence is decidable for all context-free processes (Q1899906):

Displaying 47 items.

• An algebra of behavioural types (Q418153) (← links)
• Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
• Nested semantics over finite trees are equationally hard (Q598202) (← links)
• Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) (← links)
• On the computational complexity of bisimulation, redux (Q703845) (← links)
• Product line process theory (Q898612) (← links)
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
• A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053) (← links)
• Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
• Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) (Q1314379) (← links)
• Undecidable equivalences for basic process algebra (Q1342523) (← links)
• A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
• The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
• Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
• Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
• Simulation preorder over simple process algebras (Q1854513) (← links)
• Polymorphic lambda calculus with context-free session types (Q2105433) (← links)
• Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
• Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
• Undecidable equivalences for basic parallel processes (Q2389334) (← links)
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
• Fast equivalence-checking for normed context-free processes (Q2908855) (← links)
• Partially-Commutative Context-Free Processes (Q3184678) (← links)
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity (Q3532999) (← links)
• Deciding Bisimilarity of Full BPA Processes Locally (Q3540084) (← links)
• (Q3774929) (← links)
• Actions speak louder than words: proving bisimilarity for context-free processes (Q4209294) (← links)
• Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
• Deciding properties of integral relational automata (Q4632414) (← links)
• Complexity of Weak Bisimilarity and Regularity for BPA and BPP (Q4917028) (← links)
• Petri nets, commutative context-free grammars, and basic parallel processes (Q5055893) (← links)
• On the decidability of process equivalences for the π-calculus (Q5096384) (← links)
• High undecidability of weak bisimilarity for Petri nets (Q5096742) (← links)
• Deciding the Bisimilarity of Context-Free Session Types (Q5164167) (← links)
• Reflections on a Geometry of Processes (Q5262964) (← links)
• Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity (Q5875352) (← links)
• Decidability of DPDA equivalence (Q5941060) (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
• Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
• Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
• Basic process algebra with deadlocking states (Q5958771) (← links)
• Infinite results (Q6104374) (← links)
• Bisimulation collapse and the process taxonomy (Q6104377) (← links)
• Constrained properties, semilinear systems, and Petri nets (Q6162100) (← links)
• Polymorphic higher-order context-free session types (Q6499549) (← links)
• System \(F^\mu_\omega\) with context-free session types (Q6535246) (← links)