Pages that link to "Item:Q1854338"
From MaRDI portal
The following pages link to Decidability of bisimilarity for one-counter processes. (Q1854338):
Displaying 5 items.
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Simulation preorder over simple process algebras (Q1854513) (← links)
- DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- Nonprimitive recursive complexity and undecidability for Petri net equivalences (Q5941099) (← links)
