Abstract
We present a mathematical state-machine model, the Dynamic I/O Automaton (DIOA) model, for defining and analyzing dynamic systems of interacting components. The systems we consider are dynamic in two senses: (1) components can be created and destroyed as computation proceeds, and (2) the events in which the components may participate may change. The new model admits a notion of external system behavior, based on sets of traces. It also features a parallel composition operator for dynamic systems, which respects external behavior, and a notion of simulation from one dynamic system to another, which can be used to prove that one system implements the other.
The DIOA model was defined to support the analysis of mobile agent systems, in a joint project with researchers at Nippon Telephone and Telegraph. It can also be used for other forms of dynamic systems, such as systems described by means of object-oriented programs, and systems containing services with changing access permissions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tadashi Araragi, Paul Attie, Idit Keidar, Kiyoshi Kogure, Victor Luchangco, Nancy Lynch, and Ken Mano. On formal modeling of agent computations. In NASA Workshop on Formal Approaches to Agent-Based Systems, Apr. 2000. To appear in Springer LNCS.
Paul Attie and Nancy Lynch. Dynamic input/output automata: a formal model for dynamic systems. Technical report, Northeastern University, Boston, Mass., 2001. Available at http://www.ccs.neu.edu/home/attie/pubs.html.
P.C. Attie. Liveness-preserving simulation relations. In Proceedings of the 18’th Annual ACM Symposium on Principles of Distributed Computing, pages 63–72, 1999.
Luca Cardelli and Andrew D. Gordon. Mobile ambients. Theoretical Computer Science, 240(1):177–213, 2000.
Cedric Fournet, Georges Gonthier, Jean-Jacques Levy, Luc Maranget, and Didier Remy. A calculus of mobile agents. In Proceedings of the 7th International Conference on Concurrency Theory (CONCUR’96), Springer-Verlag, LNCS 1119, pages 406–421, Aug. 1996.
Joseph Y. Halpern and Yoram Moses. Knowledge and Common Knowledge in a Distributed Environment. In Proceedings of the 3’rd Annual ACM Symposium on Principles of Distributed Computing, pages 50–61, 1984.
Nancy Lynch and Mark Tuttle. An introduction to Input/Output automata. CWI-Quarterly, 2(3):219–246, September 1989. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands. Also, Technical Memo MIT/LCS/TM-373, Laboratory for Computer Science, Massachusetts Institute of Technology.
Nancy Lynch, Michael Merritt, William Weihl, and Alan Fekete. Atomic Transactions. Morgan Kaufmann, 1994.
R. Milner. Communicating and mobile systems: the pg-calculus. Addison-Wesley, Reading, Mass., 1999.
J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Attie, P.C., Lynch, N.A. (2001). Dynamic Input/Output Automata: A Formal Model for Dynamic Systems. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-44685-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42497-0
Online ISBN: 978-3-540-44685-9
eBook Packages: Springer Book Archive