Pages that link to "Item:Q1365677"
From MaRDI portal
The following pages link to Deciding true concurrency equivalences on safe, finite nets (Q1365677):
Displayed 6 items.
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- The decidability border of hereditary history preserving bisimilarity (Q835053) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)