Dynamic consistency in process algebra: From Paradigm to ACP

作者：Andova S^*; Groenewegen L P J; de Vink E P

来源：Science of Computer Programming, 2011, 76(8): 711-735.

DOI：10.1016/j.scico.2010.04.011

• Branching bisimulation
• Collaboration
• Dynamic consistency
• Dynamic constraint
• Paradigm
• Process algebra
• Verification

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.

• 出版日期2011-8-1