2011
Dynamic Consistency in Process Algebra: From Paradigm to ACP
Publication
Publication
Science of Computer Programming , Volume 76 - Issue 8 p. 711- 735
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.
Additional Metadata | |
---|---|
, , | |
North-Holland | |
Science of Computer Programming | |
Organisation | Visualization and 3D User Interfaces |
Andova, S., Groenewegen, L., & de Vink, E. (2011). Dynamic Consistency in Process Algebra: From Paradigm to ACP. Science of Computer Programming, 76(8), 711–735. |