Towards reduction of Paradigm coordination models

Suzana Andova
(Eindhoven University of Technology)
Luuk Groenewegen
(Leiden University)
Erik de Vink
(Eindhoven University of Technology)

The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistently specified at a detailed and a global level of abstraction. To enable automated verification of Paradigm models, a translation of Paradigm into process algebra has been defined in previous work. In this paper we investigate, guided by a client-server example, reduction of Paradigm models based on a notion of global inertness. Representation of Paradigm models as process algebraic specifications helps to establish a property-preserving equivalence relation between the original and the reduced Paradigm model. Experiments indicate that in this way larger Paradigm models can be analyzed.

In Luca Aceto and Mohammad Reza Mousavi: Proceedings First International Workshop on Process Algebra and Coordination (PACO 2011), Reykjavik, Iceland, 9th June 2011, Electronic Proceedings in Theoretical Computer Science 60, pp. 1–18.
Published: 6th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.60.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org