Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Coordinating Web Services Using Channel Based Communication
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
Web services: a process algebra approach
Proceedings of the 2nd international conference on Service oriented computing
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Web services choreography and orchestration in Reo and constraint automata
Proceedings of the 2007 ACM symposium on Applied computing
An alternative algorithm for constraint automata product
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Transforming BPEL to petri nets
BPM'05 Proceedings of the 3rd international conference on Business Process Management
From BPEL processes to YAWL workflows
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Analysis of Reo Circuits using Symbolic Execution
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing three coordination models: Reo, ARC, and PBRD
Science of Computer Programming
Symbolic execution of Reo circuits using constraint automata
Science of Computer Programming
Hi-index | 0.00 |
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.