Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Vienna Development Method: The Meta-Language
The Vienna Development Method: The Meta-Language
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Verifying Mobile Processes in the HAL Environment
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Calculus for Generation, Verification and Refinement of BPEL Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
On Modelling and Analysis of Dynamic Reconfiguration of Dependable Real-Time Systems
DEPEND '10 Proceedings of the 2010 Third International Conference on Dependability
Modeling dynamic reconfigurations in Reo using high-level replacement systems
Science of Computer Programming
Toward design, modelling and analysis of dynamic workflow reconfigurations
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Towards a formal analysis of dynamic reconfiguration in WS-BPEL
Intelligent Decision Technologies
Hi-index | 0.00 |
The BP-calculus is a formalism based on the π-calculus and encoded in WS-BPEL. The BP-calculus is intended to specificaly model and verify Service Oriented Applications. One important feature of SOA is the ability to compose services that may dynamically evolve along runtime. Dynamic reconfiguration of services increases their availability, but puts accordingly, heavy demands for validation, verification, and evaluation. In this paper we formally model and analyze dynamic reconfigurations and their requirements in BP-calculus and show how reconfigurable components can be modeled using handlers that are essential parts of WS-BPEL language.