Communicating sequential processes
Communicating sequential processes
Elements of interaction: Turing award lecture
Communications of the ACM
Branching bisimilarity is an equivalence indeed!
Information Processing Letters
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A characterization of regular expressions under bisimulation
Journal of the ACM (JACM)
Ordinary interactive small-step algorithms, II
ACM Transactions on Computational Logic (TOCL)
Ordinary interactive small-step algorithms, III
ACM Transactions on Computational Logic (TOCL)
A Context-Free Process as a Pushdown Automaton
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Process Algebra: Equational Theories of Communicating Processes
Process Algebra: Equational Theories of Communicating Processes
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
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 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 model of computation to a Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.