Pages that link to "Item:Q1401395"
From MaRDI portal
The following pages link to The complexity of bisimilarity-checking for one-counter processes. (Q1401395):
Displaying 7 items.
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- (Q2754154) (← links)
- Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)