The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistently specified at various levels of abstraction. The operational semantics of Paradigm is given. For a large, general subclass of Paradigm models a translation into process algebra is provided. Once expressed in process algebra, relying on a correctness result, Paradigm models are amenable to process algebraic reasoning and to verification via the mCRL2 toolset. Examples of a scheduling problem illustrate the approach. © 2009 Elsevier B.V. All rights reserved.
Andova, S., Groenewegen, L. P. J., & De Vink, E. P. (2011). Dynamic consistency in process algebra: From Paradigm to ACP. In Science of Computer Programming (Vol. 76, pp. 711–735). https://doi.org/10.1016/j.scico.2010.04.011