Computer Science – Logic in Computer Science
Scientific paper
2011-08-09
EPTCS 60, 2011, pp. 1-18
Computer Science
Logic in Computer Science
In Proceedings PACO 2011, arXiv:1108.1452
Scientific paper
10.4204/EPTCS.60.1
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.
Andova Suzana
Groenewegen Luuk
Vink Erik de
No associations
LandOfFree
Towards reduction of Paradigm coordination models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Towards reduction of Paradigm coordination models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards reduction of Paradigm coordination models will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-69937