Pages that link to "Item:Q6104375"
From MaRDI portal
The following pages link to Decidability of bisimulation equivalence for normed pushdown processes (Q6104375):
Displayed 10 items.
- A general theory of action languages (Q1286273) (← links)
- Complete formal systems for equivalence problems (Q1575907) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- Bisimulation equivalence is decidable for one-counter processes (Q4571985) (← links)
- The equivalence problem for deterministic pushdown automata is decidable (Q4571996) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Ensuring completeness of symbolic verification methods for infinite-state systems (Q5941104) (← links)
- Bisimulation collapse and the process taxonomy (Q6104377) (← links)