Timing issues in web services composition

Authors:
Manuel Mazzara
Affiliations:
Department of Computer Science, University of Bologna, Italy
Venue:
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Year:
2005

Citing 11
Cited 0

Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Orchestrating Transactions in Join Calculus

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Fusion Machine

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The CORBA activity service framework for supporting extended transactions

Software—Practice & Experience - Special issue: Middleware
Theoretical foundations for compensations in flow composition languages

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Formal Framework for Web Services Coordination

Electronic Notes in Theoretical Computer Science (ENTCS)
Web Services Orchestration and Choreography

Computer
A Framework for Generic Error Handling in Business Processes

Electronic Notes in Theoretical Computer Science (ENTCS)
webπ at work

TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Foundations of web transactions

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A case study of web services orchestration

COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

webπ is a recent process calculus introduced to formally specify Web Services composition. It extends the π-calculus with timed workunits, namely an asynchronous and temporized mechanism for events raising and catching. In this paper we encode Berger-Honda Timed-π in webπ timed workunits and we prove a simulation theorem. The overall perspective of this work is to make webπ comparable with both real composition languages and well established models for distributed components.