Pages that link to "Item:Q1383143"
From MaRDI portal
The following pages link to Complexity of equivalence problems for concurrent systems of finite agents (Q1383143):
Displaying 10 items.
- Improved model checking of hierarchical systems (Q418123) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- Symbolic model checking for \(\mu\)-calculus requires exponential time (Q1575656) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Dichotomy results for fixed point counting in Boolean dynamical systems (Q2257296) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← links)
