Dynamic consistency in process algebra : from Paradigm to ACP

S. Andova, L.P.J. Groenewegen, E.P. Vink, de

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)


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. To enable automated verification of Paradigm models, a translation of Paradigm into process algebra is provided. Examples are given and guidelines for a systematic translation into the process algebra ACP are discussed. Verification results building on the mCRL2 toolset are presented as well.
Original languageEnglish
Title of host publicationProceedings of the 7th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA'08, Reykjavik, Iceland, July 13th, 2008; in conjunction with CONCUR'08)
EditorsP. Poizat, M. Sirjani
Publication statusPublished - 2009

Publication series

NameElectronic Notes in Theoretical Computer Science
ISSN (Print)1571-0061


Dive into the research topics of 'Dynamic consistency in process algebra : from Paradigm to ACP'. Together they form a unique fingerprint.

Cite this