Elements of interaction: Turing award lecture
Communications of the ACM
Formalization of commitment-based agent interaction
Proceedings of the 2001 ACM symposium on Applied computing
Computation beyond turing machines
Communications of the ACM - Digital rights management
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
Automated Planning in a Service-Oriented Architecture
WETICE '04 Proceedings of the 13th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
Automatic composition of transition-based semantic web services with messaging
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Journal of Computing Sciences in Colleges
Research Directions for Service-Oriented Multiagent Systems
IEEE Internet Computing
Interaction Pattern Gathering in Service-oriented Applications
SOSE '05 Proceedings of the IEEE International Workshop
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
| Hi-index | 0.00 |
Service-computing is the computing paradigm that utilises services as building blocks for developing applications or solutions. Because simplicity of services, applications and their interaction are critical for low cost and high productivity of service-computing, this paper tries to explore a proper bound of the simplicity. By proving that any Turing machine is equivalent to the interaction product of three generalised finite automata, we show that the services can be as simple as generalised finite automata and their interaction can be as simple as interaction product. Since generalised finite automata are equivalent to finite automata which are intuitively very simple, and interaction product is an interaction mechanism imposing few constraints on its components, this result is generally helpful in distributed-system design for achieving low cost and high productivity.