A formalization of the IWIM model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1906, Issue , 2000, Pages 267-283

  Katis, P ^a   Sabadini, N ^a   Walters, R F C ^a  

^a UNIVERSITY OF INSUBRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MANAGERS;

FORMAL FRAMEWORK; PARALLEL COMPOSITION; RECURSIVE EQUATIONS;

HUMAN RESOURCE MANAGEMENT;

EID: 84979236494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45263-x_17     Document Type: Conference Paper

References (13)

1. 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.
2. 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.
3. F. Arbab, Manifold version 2: Language reference manual, Technical report, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, pages: 1-162, 1996, Available on-line at http://www.cwi.nl/ftp/manifold/refman. ps. Z.
4. 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.
5. F. Arbab, What Do You Mean, Coordination?, March’98 Issue of the Bulletin of the Dutch Association for Theoretical Computer Science (NVTI)
6. A. Arnold, Finite transition systems, Prentice Hall, 1994.
7. 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.
8. P. Katis, N. Sabadini, R. F. C. Walters, Bicategories of processes, Journal of Pure and Applied Algebra 115: 141-178, 1997.
9. 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.
10. 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.
11. P. Katis, N. Sabadini, R. F. C. Walters, An algebra of automata for reconfiguring networks of interacting components, manuscript.
12. R. F. C. Walters, Categories and Computer Science, Carslaw Publications 1991, Cambridge University Press, 1992.
13. W. Zielonka, Note on asynchronous automata, RAIRO, 1987.