Abstract
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical systems of recursive equations for streams. We give logical rules that describe the communication within a net and the dynamic creation of components, channels and rearrangement of the net structure. Such net transformations are based on a calculus of declarations of identifiers for data elements and especially for streams and equational logic. We demonstrate the modelling of interactive systems that correspond to dynamically changing net structures as obtained in systems with dynamic process creation (such as in object oriented approaches) within a framework of classical equational logic.
This work was partially sponsored by the Sonderforschungsbereich 342 “Werkzeuge und Methoden für die Nutzung paralleler Rechnerarchitekturen” and by the EC BRA Working Group COMPASS.
Preview
Unable to display preview. Download preview PDF.
References
M. Broy: Specification and top down design of distributed systems. In: H. Ehrig et al. (eds.): Formal Methods and Software Development. Lecture Notes in Computer Science 186, Springer 1985, 4–28, Revised version in JCSS 34:2/3, 1987, 236–264
M. Broy: A theory for nondeterminism, parallelism, communication and concurrency. Habilitation, Fakultät für Mathematik und Informatik der Technischen Universität München, 1982, Revised version in: Theoretical Computer Science 45 (1986) 1–61
M. Broy: Semantics of finite or infinite networks of communicating agents. Distributed Computing 2 (1987), 13–31
M. Broy: Predicative specification for functional programs describing communicating networks. Information Processing Letters 25 (1987) 93–101
P. Dybier, H. Sander: A functional programming approach to the specification and verification of concurrent systems. Chalmers University of Technology and University of Göteborg, Department of Computer Sciences 1988
R. Grosu: A formal foundation for concurrent object oriented programming. Ph. D. Thesis, Technische Universität München, Fakultät für Informatik, submitted 1994
G. Kahn, D. MacQueen: Coroutines and networks of processes, Proc. IFIP World Congress 1977, 993–998
R. Milner, J. Parrow, D. Walker: A calculus of mobile processes. Part i + ii, Information and Computation, 100:1 (1992) 1–40, 41–77
V.A. Saraswat: Concurrent constraint programming languages. Ph. D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, CA, 1989
G. Smolka: A calculus for higher order concurrent constraint programming with deep guards. DFKI Research Report RR-94-03
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broy, M. (1995). Equations for describing dynamic nets of communicating systems. In: Astesiano, E., Reggio, G., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1994 1994. Lecture Notes in Computer Science, vol 906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014427
Download citation
DOI: https://doi.org/10.1007/BFb0014427
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59132-0
Online ISBN: 978-3-540-49198-9
eBook Packages: Springer Book Archive