-
Companion to the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2011, part of SPLASH 2011, Portland, OR, USA, October 22 - 27, 2011; 01/2011
-
Electr. Notes Theor. Comput. Sci. 01/2009; 229:155-174.
-
Web Services and Formal Methods, 4th International Workshop, WS-FM 2007, Brisbane, Australia, September 28-29, 2007. Proceedings; 01/2007
-
Formal Methods and Software Engineering, 8th International Conference on Formal Engineering Methods, ICFEM 2006, Macao, China, November 1-3, 2006, Proceedings; 01/2006
-
[show abstract]
[hide abstract]
ABSTRACT: A tool is developed in order to input Reo circuits and generate their corresponding constraint automata. The XML schemas for input and output are presented which establish a common interface for generating an integrated set of tools. Two heuristics in joining constraint automata are presented and experimental results are shown.
Electronic Notes in Theoretical Computer Science.
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper we propose an approach to derive the formal semantics of WS-BPEL processes compositionally using Reo and constraint automata. We map each WS-BPEL process into a Reo circuit and then construct the corresponding constraint automaton which shows the behavior of the process. The constraint automaton can be used for analyzing the process behavior. Our work covers the core part of the WS-BPEL language including basic and structured activities, correlation sets, variables, and links.
-
[show abstract]
[hide abstract]
ABSTRACT: WS-CDL is a choreography language that describes peer-to-peer collaborations of participants by defining their common and complementary observable behaviors from a global viewpoint. The main use of a choreography description is to precisely define the sequence of interactions between a set of cooperating web services in order to promote a common understanding between participants and to make it easy to automatically validate conformance and ensure interoperability. To this purpose, WS-CDL must be based on or related to a formal language that provides these validation capabilities. In this paper, we benefit from Reo and Constraint Automata with State Memory (CASM) to address this problem by providing a unified formalism for choreography and orchestration. Furthermore, we show how to exploit this formalism for conformance validation by giving proper definitions for end-point projection and conformance problem.
Electronic Notes in Theoretical Computer Science.
