Dynamic consistency in process algebra: From Paradigm to ACP

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

  • Affiliations:
  • Formal Methods Group, Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;FaST Group, Leiden Institute of Advanced Computer Science, Leiden University, The Netherlands;Formal Methods Group, Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands

  • Venue:
  • Science of Computer Programming
  • Year:
  • 2011

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