Abstract
The authors introduce case-place automata as an abstract formal framework for the ‘idealized workers and idealized managers’ (IWIM) model on which the language MANIFOLD is based. Case-place automata are equipped with left/right interfaces and in/out conditions, that are used to compose automata according to three main operations, namely restricted product, free product, and restricted sum. These operations find natural interpretations in terms of parallel composition of communicating workers and reconfigurations of modules. Taking the ‘distributed sort’ algorithm of [4] as a case study, it is shown that the manager process can be expressed as a recursive equation in the algebra of automata.
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
F. Arbab, Coordination of massively concurrent activities, Technical Report CS-R9565, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1995, Available on-line at http://www.cwi.nl/ftp/CWIreports/IS/CS-R9565.ps.Z.
F. Arbab, The IWIM model for coordination of concurrent activities. In Paolo Ciancarini and Chris Hankin, editors, Coordination Languages and Models, volume 1061 of Lecture Notes in Computer Science, 34–56, Springer-Verlag, 1996.
F. Arbab, Manifold version 2: Language reference manual, Technical report, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, pages: 1–162, h1996, Available on-line at http://www.cwi.nl/ftp/manifold/refman.ps.Z.
F. Arbab, C. L. Blom, F. J. Burger, and C. T. H. Everaars, Reusable Coordination Modules for Massively Concurrent Applications, Software: Practice and Experience, vol. 28, No. 7: 703–735, 1998.
F. Arbab, What Do You Mean, Coordination?, Marc’98 Issue of the Bulletin of the Dutch Association for Theoretical Computer Science (NVTI)
A. Arnold, Finite transition systems, Prentice Hall, 1994.
M.M. Bonsangue, F. Arbab, J.W. de Bakker, J.J.M.M. Rutten, A. Scutellá, G. Zavattaro, A transition system semantics for the control-driven coordination language MANIFOLD, Technical Report SEN-R9829, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1998.
P. Katis, N. Sabadini, R.F.C. Walters, Bicategories of processes, Journal of Pure and Applied Algebra 115: 141–178, 1997.
P. Katis, N. Sabadini, R.F.C. Walters, Span(Graph): A categorical algebra of transition systems, Proceedings Algebraic Methodology and Software Technology, volume 1349 of Lecture Notes in Computer Science, 307–321, Springer Verlag, 1997.
P. Katis, N. Sabadini, R.F.C. Walters, On the algebra of systems with feedback and boundary, Rendiconti del Circolo Matematico di Palermo Serie II, Suppl. 63: 123–156, 2000.
P. Katis, N. Sabadini, R.F.C. Walters, An algebra of automata for reconfiguring networks of interacting components, manuscript.
R.F.C. Walters, Categories and Computer Science, Carslaw Publications 1991, Cambridge University Press, 1992.
W. Zielonka, Note on asynchronous automata, RAIRO, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Katis, P., Sabadini, N., Walters, R.F.C. (2000). A Formalization of the IWIM Model. In: Porto, A., Roman, GC. (eds) Coordination Languages and Models. COORDINATION 2000. Lecture Notes in Computer Science, vol 1906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45263-X_17
Download citation
DOI: https://doi.org/10.1007/3-540-45263-X_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41020-1
Online ISBN: 978-3-540-45263-8
eBook Packages: Springer Book Archive