Dynamic Consistency in Process Algebra: From Paradigm to ACP

  • Authors:
  • S. Andova;L. P. J. Groenewegen;E. P. de Vink

  • Affiliations:
  • Formal Methods Group, Technical University of Eindhoven, The Netherlands;FaST Group, LIACS, Leiden University, The Netherlands;Formal Methods Group, Technical University of Eindhoven, The Netherlands

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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 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.