The paradigm of service-oriented computing revolutionized the field of software engineering. According to this paradigm, new systems are composed of existing stand-alone services to support complex cross-organizational business processes. Correct communication of these services is not possible without a proper coordination mechanism. The Reo coordination language is a channel-based modeling language that introduces various types of channels and their composition rules. By composing Reo channels, one can specify Reo connectors that realize arbitrary complex behavioral protocols. Several formalisms have been introduced to give semantics to Reo. In their most basic form, they reflect service synchronization and dataflow constraints imposed by connectors. To ensure that the composed system behaves as intended, we need a wide range of automated verification tools to assist service composition designers. In this paper, we present our framework for the verification of Reo using the mCRL2 toolset. We unify our previous work on mapping various semantic models for Reo, namely, constraint automata, timed constraint automata, coloring semantics and the newly developed action constraint automata, to the process algebraic specification language of mCRL2, address the correctness of this mapping, discuss tool support, and present a detailed example that illustrates the use of Reo empowered with mCRL2 for the analysis of dataflow in service-based process models.
Additional Metadata
ACM Formal Definitions and Theory (acm D.3.1), Specifying and Verifying and Reasoning about Programs (acm F.3.1)
THEME Software (theme 1)
Publisher Springer
Journal Formal Aspects of Computing
Citation
Kokash, N, C. (born Köhler, , C.) Krause, ,, & de Vink, E.P. (2012). Reo + mCRL2: A Framework for Model-Checking Dataflow in Service Compositions. Formal Aspects of Computing, 24, 187–216.