Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Elements of interaction: Turing award lecture
Communications of the ACM
The topological structure of asynchronous computability
Journal of the ACM (JACM)
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Computation beyond turing machines
Communications of the ACM - Digital rights management
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Mathematical Models of Interactive Computing
Mathematical Models of Interactive Computing
Persistence as a Form of Interaction
Persistence as a Form of Interaction
Mathematical Structures in Computer Science
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Hi-index | 0.00 |
Interaction, as an important computing paradigm, is far beyond incremental technological development. Various models such as interaction machines and process algebras have been developed to help design and analyze interaction systems. However, little is reported on the computability theory of interaction, and the design and analysis still have to be performed in an ad hoc way. Hence, the question is: how to uniformly evaluate the power of interaction? Roughly, I plan to explore this question in three steps. The first is to find out a universal formal model for interaction. The second is to abstract the tasks of interaction. The third is to evaluate the capability of interaction in terms of the results of step 1 and 2. The anticipated result may be expressed as a hierarchy that extends Chomsky hierarchy from above. Possible application of the hierarchy is also presented.