Reactive Turing Machines

DOI10.1007/978-3-642-22953-4_30zbMath1342.68126OpenAlexW2169491147MaRDI QIDQ3088297

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

Publication date: 19 August 2011

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/43843246-f4ad-4f6c-b35d-a5c14ef5ee0c

Mathematics Subject Classification ID

Related Items (1)

CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing machines, transition systems, and interaction
• Algebra of communicating processes with abstraction
• On the consistency of Koomen's fair abstraction rule
• Bisimulation and effectiveness
• Branching Bisimilarity with Explicit Divergence
• A Process-Theoretic Look at Automata
• Branching time and abstraction in bisimulation semantics
• Interactive Small-Step Algorithms I: Axiomatization
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Systems of Logic Based on Ordinals^†

This page was built for publication: Reactive Turing Machines