Pages that link to "Item:Q1892892"
From MaRDI portal
The following pages link to Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\) (Q1892892):
Displaying 6 items.
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) (Q1314379) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- On deciding readiness and failure equivalences for processes (Q1892874) (← links)
- Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Bisimulation collapse and the process taxonomy (Q6104377) (← links)