Pages that link to "Item:Q6104377"
From MaRDI portal
The following pages link to Bisimulation collapse and the process taxonomy (Q6104377):
Displaying 12 items.
- Regularity of normed PA processes (Q294692) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- Process rewrite systems. (Q1854328) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- Characteristic invariants in Hennessy-Milner logic (Q2182678) (← links)
- Generative program analysis and beyond: the power of domain-specific languages (invited paper) (Q2234057) (← links)
- Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
- Reflections on a Geometry of Processes (Q5262964) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Basic process algebra with deadlocking states (Q5958771) (← links)
- Regularity is decidable for normed PA processes in polynomial time (Q6567761) (← links)
