Pages that link to "Item:Q4209294"
From MaRDI portal
The following pages link to Actions speak louder than words: proving bisimilarity for context-free processes (Q4209294):
Displaying 11 items.
- 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)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Regular Strategies as Proof Tactics for CIRC (Q2873678) (← links)
- Deciding Bisimilarity of Full BPA Processes Locally (Q3540084) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
- A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity (Q6135767) (← links)
