Communicating sequential processes
Communicating sequential processes
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
On the consistency of Koomen's fair abstraction rule
Theoretical Computer Science
Bisimulation and effectiveness
Information Processing Letters
Notes on algebraic calculi of processes
Logics and models of concurrent systems
On the development of reactive systems
Logics and models of concurrent systems
A note on expressiveness of process algebra
Proceedings of the First Imperial College Department of Computing Workshop on Theory and formal methods 1993
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Communication and Concurrency
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Turing machines, transition systems, and interaction
Information and Computation
Process Algebra: Equational Theories of Communicating Processes
Process Algebra: Equational Theories of Communicating Processes
A process-theoretic look at automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
| Hi-index | 0.00 |
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 simulated modulo branching bisimilarity by an RTM, and that every computable transition system with a bounded branching degree is simulated modulo divergencepreserving branching bisimilarity. We conclude from these results that the parallel composition of (communicating) RTMs can be simulated by a single RTM. We prove that there exist universal RTMs modulo branching bisimilarity, but these essentially employ divergence to be able to simulate an RTM of arbitrary branching degree. We also prove that modulo divergence-preserving branching bisimilarity there are RTMs that are universal up to their own branching degree. Finally, we establish a correspondence between RTMs and the process theory TCPτ.