Results 1 -
7 of
7
Formalizing higher-order mobile embedded business processes with binding bigraphs
- IN PROCEEDINGS OF COORDINATION 08, LECTURE NOTES IN COMPUTER SCIENCE
, 2008
"... We propose and formalize HomeBPEL, a higher-order WS-BPEL-like business process execution language where processes are firstclass values that can be stored in variables, passed as messages, and activated as embedded sub-instances. A sub-instance is similar to a WS-BPEL scope, except that it can be ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
(Show Context)
We propose and formalize HomeBPEL, a higher-order WS-BPEL-like business process execution language where processes are firstclass values that can be stored in variables, passed as messages, and activated as embedded sub-instances. A sub-instance is similar to a WS-BPEL scope, except that it can be dynamically frozen and stored as a process in a variable, and then subsequently be thawed when reactivated as a sub-instance. We motivate HomeBPEL by an example of pervasive health care where treatment guidelines are dynamically deployed as sub processes that may be delegated dynamically to other workflow engines and in particular stay available for disconnected operation on mobile devices. We provide a formal semantics based on binding bigraphical reactive systems implemented in the BPL Tool as part of the Bigraphical Programming Languages project at ITU. The semantics is an extension of a semantics given previously for a simplified subset of WS-BPEL and exploits the close correspondence between bigraphs and XML to provide a formalized run-time format very close to standard WS-BPEL syntax, which also constitutes the representation of frozen sub-instances.
Multi-agent systems design and prototyping with bigraphical
"... reactive systems? ..."
(Show Context)
A standard-driven implementation of WS-BPEL 2.0
"... We present a systematic study of the WS-BPEL 2.0 standard based on two complementary methods: the process of constructing a new high-level WS-BPEL implementation driven by the structure of the standard, and an empirical evaluation of existing interpretations of the standard reflected in five widely ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
We present a systematic study of the WS-BPEL 2.0 standard based on two complementary methods: the process of constructing a new high-level WS-BPEL implementation driven by the structure of the standard, and an empirical evaluation of existing interpretations of the standard reflected in five widely available WS-BPEL-implementations, both commercial and open source. In doing so we uncover a number of new ambiguities. Most notably, WS-BPEL’s integration of XPath 1.0, the data access component of WS-BPEL, turns out to be inconsistent with the XPath standard itself, which is evidenced by substantially differing results produced by existing implementations on test cases constructed to exercise their interpretation. The core concepts in WS-BPEL have been formalized and analyzed successfully previously. Our choice to study the standard by constructing a high-level, standard-driven implementation rather than an abstract, mathematical formalization has made it feasible to cover the complete standard, notably the integration with XPath. Given WS-BPEL’s design goal of being platform-independent the inconsistencies are arguably a serious concern since they cannot be attributed to the quality of any particular implementation.
Analysis of the WS-BPEL 2.0 standard using standard-driven implementation
"... Abstract. We present a systematic study of the OASIS WS-BPEL 2.0 standard (henceforth simply called BPEL) based on two complementary methods: the process of constructing a new high-level BPEL implementation driven by the structure of the standard, and an empirical evaluation of existing interpretati ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. We present a systematic study of the OASIS WS-BPEL 2.0 standard (henceforth simply called BPEL) based on two complementary methods: the process of constructing a new high-level BPEL implementation driven by the structure of the standard, and an empirical evaluation of existing interpretations of the standard reflected in five widely available BPEL-implementations, both commercial and open source. In doing so we uncover a number of new ambiguities. Most notably, BPEL’s integration of XPath 1.0, the data access component of BPEL, turns out to be inconsistent with the XPath standard itself, which is evidenced by substantially differing results produced by existing implementations on test cases constructed to exercise their interpretation. The core concepts in BPEL have been formalized and analyzed successfully previously. We believe this to be the first study of the complete BPEL standard, however, that investigates its integration with other standards, notably XPath. Given BPEL’s design goal of being platformindependent the inconsistencies are arguably a serious concern since they cannot be attributed to the quality of any particular implementation. Beepell, the BPEL engine and visual execution environment implemented by the first author in Java that has resulted from this effort is open source and freely available for educational, research and application purposes.
ECEASST Big Red: A Development Environment for Bigraphs
"... Abstract: We present Big Red, a visual editor for bigraphs and bigraphical reactive systems, based upon Eclipse. The editor integrates with several existing bigraph tools to permit simulation and reachability analysis of bigraphical models. We give a brief introduction to the bigraphs formalism, and ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: We present Big Red, a visual editor for bigraphs and bigraphical reactive systems, based upon Eclipse. The editor integrates with several existing bigraph tools to permit simulation and reachability analysis of bigraphical models. We give a brief introduction to the bigraphs formalism, and show how these concepts manifest within the tool using a small motivating example developed in Big Red. We go on to outline its architecture and implementation, and comment on possible future work.
unknown title
"... We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivating example to demonstrate that the proposed notion of refinement is sensible with ..."
Abstract
- Add to MetaCart
(Show Context)
We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivating example to demonstrate that the proposed notion of refinement is sensible with respect to the theory of bigraphical reactive systems; and we propose a sufficient condition for guaranteeing the existence of a safety-preserving vertical refinement. We postulate the existence of a complimentary notion of horizontal refinement for bigraphical agents, and finally we discuss the connection of this work to the general refinement of Reeves and Streader. 1
