Reactive Turing machines

DOI10.1016/j.ic.2013.08.010zbMath1358.68097OpenAlexW2678861921MaRDI QIDQ393091

Paul van Tilburg, Jos C. M. Baeten, Bas Luttik

Publication date: 16 January 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2013.08.010

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Pushdown Automata and Context-Free Grammars in Bisimulation Semantics ⋮ On the Executability of Interactive Computation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity ⋮ Unnamed Item ⋮ A thesis for interaction

Cites Work

• Turing machines, transition systems, and interaction
• Turing machines that take advice
• On the expressiveness of interaction
• On the consistency of Koomen's fair abstraction rule
• Bisimulation and effectiveness
• Two finite specifications of a queue
• A structural approach to operational semantics
• Towards a unified approach to encodability and separation results for process calculi
• Expressiveness of Process Algebras
• Branching Bisimilarity with Explicit Divergence
• A Process-Theoretic Look at Automata
• Computation Tree Logic with Deadlock Detection
• How We Think of Computing Today
• On the expressive power of recursion, replication and iteration in process calculi
• Branching time and abstraction in bisimulation semantics
• Interactive Small-Step Algorithms I: Axiomatization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item