The following pages link to (Q4942620):
Displaying 14 items.
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- Decision problems for pushdown threads (Q884992) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) (← links)
- On detectability of labeled Petri nets and finite automata (Q2197590) (← links)
- Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
- Decidability of performance equivalence for basic parallel processes (Q2503324) (← links)
- Deciding properties of integral relational automata (Q4632414) (← links)
- Petri nets, commutative context-free grammars, and basic parallel processes (Q5055893) (← links)
- On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions (Q5060067) (← links)
- High undecidability of weak bisimilarity for Petri nets (Q5096742) (← links)
- Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Deciding bisimulation and trace equivalences for systems with many identical processes (Q6487976) (← links)
