@inproceedings{72aae024ad2c48b6a3c5b29c1f6bfd97,
title = "Towards reduction of Paradigm coordination models",
abstract = "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.",
author = "S. Andova and L.P.J. Groenewegen and {Vink, de}, E.P.",
year = "2011",
doi = "10.4204/EPTCS.60.1",
language = "English",
series = "Electronic Proceedings in Theoretical Computer Science",
publisher = "EPTCS",
pages = "1--18",
editor = "L. Aceto and M.R. Mousavi",
booktitle = "Proceedings of the First International Workshop on Process Algebra and Coordination (PACO 2011, Reykjavik, Iceland, June 9, 2011)",
}