Pages that link to "Item:Q1314379"

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

Displaying 20 items.

• Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
• 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)
• Deciding branching bisimilarity of normed context-free processes ls in \(\sum_ 2^ p\) (Q1892892) (← links)
• Bisimulation equivalence is decidable for all context-free processes (Q1899906) (← links)
• Complexity of deciding bisimilarity between normed BPA and normed BPP (Q1959482) (← links)
• Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
• Weak bisimilarity and regularity of context-free processes is EXPTIME-hard (Q2847410) (← links)
• Fast equivalence-checking for normed context-free processes (Q2908855) (← links)
• (Q4222869) (← 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)
• (Q4818834) (← links)
• Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences (Q5179048) (← 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)
• Decidability results in automata and process theory (Q6560390) (← links)