Reactive Turing machines
DOI10.1016/J.IC.2013.08.010zbMATH Open1358.68097OpenAlexW2678861921MaRDI QIDQ393091FDOQ393091
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
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A structural approach to operational semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branching time and abstraction in bisimulation semantics
- Title not available (Why is that?)
- Interactive Small-Step Algorithms I: Axiomatization
- On the consistency of Koomen's fair abstraction rule
- Bisimulation and effectiveness
- Two finite specifications of a queue
- Towards a unified approach to encodability and separation results for process calculi
- Process algebra with recursive operations
- Expressiveness of process algebras
- Title not available (Why is that?)
- Branching Bisimilarity with Explicit Divergence
- A process-theoretic look at automata
- Computation tree logic with deadlock detection
- Process algebra: equational theories of communicating processes. With forewords by Tony Hoare, Robin Milner and Jan Bergstra.
- How We Think of Computing Today
- On the expressive power of recursion, replication and iteration in process calculi
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turing machines, transition systems, and interaction
- Turing machines that take advice
- On the expressiveness of interaction
Cited In (15)
- Reactive Turing machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Turing machines, transition systems, and interaction
- Turing machines, transition systems, and interaction
- On the executability of interactive computation
- Title not available (Why is that?)
- 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)
- Title not available (Why is that?)
- 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)
