[HTML][HTML] Reactive turing machines
JCM Baeten, B Luttik, P Van Tilburg - Information and Computation, 2013 - Elsevier
We propose reactive Turing machines (RTMs), extending classical Turing machines with a
process-theoretical notion of interaction, and use it to define a notion of executable transition …
process-theoretical notion of interaction, and use it to define a notion of executable transition …
Sequential composition in the presence of intermediate termination
The standard operational semantics of the sequential composition operator gives rise to
unbounded branching and forgetfulness when transparent process expressions are put in …
unbounded branching and forgetfulness when transparent process expressions are put in …
On the executability of interactive computation
The model of interactive Turing machines (ITMs) has been proposed to characterise which
stream translations are interactively computable; the model of reactive Turing machines …
stream translations are interactively computable; the model of reactive Turing machines …
Sequencing and intermediate acceptance: axiomatisation and decidability of bisimilarity
Abstract The Theory of Sequential Processes includes deadlock, successful termination,
action prefixing, alternative and sequential composition. Intermediate acceptance, which is …
action prefixing, alternative and sequential composition. Intermediate acceptance, which is …
Computation and Concurrency
Y Wang - arXiv preprint arXiv:2409.02595, 2024 - arxiv.org
arXiv:2409.02595v1 [cs.LO] 4 Sep 2024 Page 1 arXiv:2409.02595v1 [cs.LO] 4 Sep 2024 C o m
p u ta tio n a n d C o n cu rren cy — Y on g W an g — Page 2 Contents 1 Introduction 1 2 …
p u ta tio n a n d C o n cu rren cy — Y on g W an g — Page 2 Contents 1 Introduction 1 2 …
Computations and interaction
JCM Baeten, B Luttik, P van Tilburg - International Conference on …, 2011 - Springer
We enhance the notion of a computation of the classical theory of computing with the notion
of interaction. In this way, we enhance a Turing machine as a model of computation to a …
of interaction. In this way, we enhance a Turing machine as a model of computation to a …
Reactive turing machines
JCM Baeten, B Luttik, P van Tilburg - International Symposium on …, 2011 - Springer
We propose reactive Turing machines (RTMs), extending classical Turing machines with a
process-theoretical notion of interaction. We show that every effective transition system is …
process-theoretical notion of interaction. We show that every effective transition system is …
Parallel Pushdown Automata and Commutative Context-Free Grammars in Bisimulation Semantics
A classical theorem states that the set of languages given by a pushdown automaton
coincides with the set of languages given by a context-free grammar. In previous work, we …
coincides with the set of languages given by a context-free grammar. In previous work, we …
Pushdown automata and context-free grammars in bisimulation semantics
JCM Baeten, C Carissimo… - Logical Methods in …, 2023 - lmcs.episciences.org
The Turing machine models an old-fashioned computer, that does not interact with the user
or with other computers, and only does batch processing. Therefore, we came up with a …
or with other computers, and only does batch processing. Therefore, we came up with a …
Turing meets milner
JCM Baeten, B Luttik, P Van Tilburg - … upon Tyne, UK, September 4-7 …, 2012 - Springer
We enhance the notion of a computation of the classical theory of computing with the notion
of interaction from concurrency theory. In this way, we enhance a Turing machine as a …
of interaction from concurrency theory. In this way, we enhance a Turing machine as a …