Decision problems for pushdown threads

DOI10.1007/s00236-007-0040-5zbMath1120.68077OpenAlexW2145847760MaRDI QIDQ884992

Inge Bethke, Alban Ponse, Jan A. Bergstra

Publication date: 7 June 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-007-0040-5

zbMATH Keywords

stacks

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Thread algebra for poly-threading ⋮ Thread algebra for strategic interleaving ⋮ On the contribution of backward jumps to instruction sequence expressiveness ⋮ Straight-line instruction sequence completeness for total calculation on cancellation meadows ⋮ Risk assessment for one-counter threads

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence problem for deterministic two-tape automata
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Execution architectures for program algebra
• Risk assessment for one-counter threads
• Deterministic one-counter automata
• Theory of program structures: Schemes, semantics, verification
• The inclusion problem for simple languages
• On the equivalence problem for E-pattern languages
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Program algebra for sequential code
• Combining programs and state machines
• Process algebra for synchronous communication
• Processes and the denotational semantics of concurrency
• The equivalence problem for deterministic finite-turn pushdown automata
• New Computational Paradigms
• Decidability of DPDA equivalence

This page was built for publication: Decision problems for pushdown threads