Pages that link to "Item:Q1314379"

The following pages link to Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\) (Q1314379):

Displayed 9 items.

• Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) ‎ (← links)
• A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053) ‎ (← links)
• A note on the complexity of deciding bisimilarity of normed unary processes (Q1331934) ‎ (← links)
• A polynomial algorithm for deciding bisimilarity of normed context-free processes (Q1351456) ‎ (← links)
• On deciding some equivalences for concurrent processes (Q4362275) ‎ (← links)
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes (Q4715674) ‎ (← links)
• Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) ‎ (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) ‎ (← links)
• Infinite results (Q6104374) ‎ (← links)