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)
Why interaction is more powerful than algorithms
Communications of the ACM
Two finite specifications of a queue
ACP '95 Proceedings from the international workshop on Algebra of communicating processes
Communication and Concurrency
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
Proceedings of the 11th Colloquium on Automata, Languages and Programming
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Beyond the Turing Limit: Evolving Interactive Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Expressive Results for Process Algebras
Proceedings of the REX Workshop on Sematics: Foundations and Applications
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
How We Think of Computing Today
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
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
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
On the expressiveness of interaction
Theoretical Computer Science
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
A process-theoretic look at automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Hi-index | 0.00 |
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 system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and that every effective transition system is simulated modulo the variant of branching bisimilarity that does not require divergence preservation. 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. We establish a correspondence between executability and finite definability in a simple process calculus. Finally, we establish that RTMs are at least as expressive as persistent Turing machines.