Pages that link to "Item:Q1203120"
From MaRDI portal
The following pages link to Deciding bisimilarity is P-complete (Q1203120):
Displaying 19 items.
- A connection between concurrency and language theory (Q265802) (← links)
- Lattice-valued simulations for quantitative transition systems (Q473367) (← links)
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- The strength of extensionality. II: Weak weak set theories without infinity (Q639665) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) (← links)
- EXPTIME-completeness of thorough refinement on modal transition systems (Q690504) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q1763731) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- On the axiomatisability of priority. III: Priority strikes again (Q2193294) (← links)
- Refinement checking on parametric modal transition systems (Q2340259) (← links)
- Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644) (← links)
- Compressed Tree Canonization (Q3449487) (← links)
- (Q4553282) (← links)
- (Q5111633) (← links)
