Pages that link to "Item:Q2851063"
From MaRDI portal
The following pages link to Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time (Q2851063):
Displaying 5 items.
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- On reachability equivalence for BPP-nets (Q1391745) (← links)
- Bisimilarity on basic parallel processes (Q2072066) (← links)
- (Q4270070) (← links)
- A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems (Q5958118) (← links)