Pages that link to "Item:Q1342523"

The following pages link to Undecidable equivalences for basic process algebra (Q1342523):

Displaying 28 items.

• Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
• Nested semantics over finite trees are equationally hard (Q598202) (← links)
• Deciding bisimulation and trace equivalences for systems with many identical processes (Q672063) (← links)
• On the computational complexity of bisimulation, redux (Q703845) (← links)
• Equational reasoning about nondeterministic processes (Q911801) (← links)
• An incompleteness result in process algebra (Q1113665) (← links)
• A short proof of the decidability of bisimulation for normed BPA- processes (Q1198053) (← links)
• Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
• A note on the complexity of deciding bisimilarity of normed unary processes (Q1331934) (← links)
• The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
• Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
• Effective decomposability of sequential behaviours (Q1575536) (← links)
• Simulation preorder over simple process algebras (Q1854513) (← links)
• On deciding readiness and failure equivalences for processes (Q1892874) (← links)
• Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
• Undecidable equivalences for basic parallel processes (Q2389334) (← links)
• (Q2736352) (← links)
• Refining the undecidability border of weak bisimilarity (Q2852014) (← links)
• A note on limited pushdown alphabets in stateless deterministic pushdown automata (Q2856007) (← links)
• On deciding some equivalences for concurrent processes (Q4362275) (← links)
• Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
• Negative Results on Decidability and Small Model Property of Process Equations (Q5217303) (← links)
• Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
• Programming Languages and Systems (Q5464037) (← links)
• Pushdown automata, multiset automata, and Petri nets (Q5941098) (← links)
• Basic process algebra with deadlocking states (Q5958771) (← links)
• Underspecification for a simple process algebra of recursive processes. (Q5958781) (← links)
• Infinite results (Q6104374) (← links)