Pages that link to "Item:Q1198053"
From MaRDI portal
The following pages link to A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053):
Displaying 13 items.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- A note on the complexity of deciding bisimilarity of normed unary processes (Q1331934) (← 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)
- Deciding Bisimilarity of Full BPA Processes Locally (Q3540084) (← links)
- On deciding some equivalences for concurrent processes (Q4362275) (← links)
- A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674) (← links)
- Reflections on a Geometry of Processes (Q5262964) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← 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)
