Computations and interaction

Authors:
Jos C. M. Baeten;Bas Luttik;Paul van Tilburg
Affiliations:
Department of Mechanical Engineering and Division of Computer Science, Eindhoven University of Technology, MB Eindhoven, The Netherlands;Division of Computer Science, Eindhoven University of Technology, MB Eindhoven and Department of Computer Science, Vrije Universiteit Amsterdam, HV Amsterdam, The Netherlands;Division of Computer Science, Eindhoven University of Technology, MB Eindhoven, The Netherlands
Venue:
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Year:
2011

Citing 10
Cited 1

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
Infinite Results

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
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
A characterization of regular expressions under bisimulation

Journal of the ACM (JACM)
A Context-Free Process as a Pushdown Automaton

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
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

Turing meets milner

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.