The following pages link to (Q4708592):
Displaying 10 items.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- A general approach to comparing infinite-state systems with their finite-state specifications (Q2503044) (← links)
- (Q4558784) (← links)
- (Q4673421) (← links)
- Pushdown Automata and Context-Free Grammars in Bisimulation Semantics (Q5883743) (← links)
- (Q6165566) (← links)