The following pages link to (Q2754154):
Displaying 6 items.
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- Countdown games, and simulation on (succinct) one-counter nets (Q5883735) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)