Pages that link to "Item:Q1854513"
From MaRDI portal
The following pages link to Simulation preorder over simple process algebras (Q1854513):
Displaying 6 items.
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- 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)
- 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)
