Reactive Turing machines

DOI10.1016/J.IC.2013.08.010MaRDI QIDQ393091zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Reactive Turing machines
• Reactive automata
• Reaction automata
• Probabilistic rebound Turing machines
• Involutory Turing machines
• A NOTE ON REBOUND TURING MACHINES
• A hierarchy of fast reversible Turing machines
• scientific article; zbMATH DE number 3924764
• Reactive computing as model generation
• Modular refinement of hierarchic reactive machines

Cites work

• scientific article; zbMATH DE number 4016181 (Why is no real title available?)
• scientific article; zbMATH DE number 3926231 (Why is no real title available?)
• scientific article; zbMATH DE number 3930354 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 2080910 (Why is no real title available?)
• scientific article; zbMATH DE number 3894457 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A process-theoretic look at automata
• A structural approach to operational semantics
• Bisimulation and effectiveness
• Branching Bisimilarity with Explicit Divergence
• Branching time and abstraction in bisimulation semantics
• Computation tree logic with deadlock detection
• Expressiveness of process algebras
• How We Think of Computing Today
• Interactive Small-Step Algorithms I: Axiomatization
• On the consistency of Koomen's fair abstraction rule
• On the expressive power of recursion, replication and iteration in process calculi
• On the expressiveness of interaction
• Process algebra with recursive operations
• Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
• Towards a unified approach to encodability and separation results for process calculi
• Turing machines that take advice
• Turing machines, transition systems, and interaction
• Two finite specifications of a queue

Cited in

(15)

• Reactive Turing machines
• scientific article; zbMATH DE number 7449994 (Why is no real title available?)
• Turing machines, transition systems, and interaction
• scientific article; zbMATH DE number 1507282 (Why is no real title available?)
• Turing machines, transition systems, and interaction
• On the executability of interactive computation
• scientific article; zbMATH DE number 7243676 (Why is no real title available?)
• A universal reactive machine
• Sequential composition in the presence of intermediate termination (extended abstract)
• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• A thesis for interaction
• Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
• Executable behaviour and the \(\pi \)-calculus (extended abstract)
• scientific article; zbMATH DE number 7453959 (Why is no real title available?)
• Pushdown Automata and Context-Free Grammars in Bisimulation Semantics

This page was built for publication: Reactive Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393091)