Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Temporal Reasoning in Workflow Systems
Distributed and Parallel Databases
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Types and Subtypes for Client-Server Interactions
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
Conversation specification: a new approach to design and analysis of e-service composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
Web Service Conversation Modeling: A Cornerstone for E-Business Automation
IEEE Internet Computing
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
WWW '05 Proceedings of the 14th international conference on World Wide Web
Analyzing Conversations of Web Services
IEEE Internet Computing
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Timed Modelling and Analysis inWeb Service Compositions
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
An automaton-based approach to the verification of timed workflow schemas
TIME '06 Proceedings of the Thirteenth International Symposium on Temporal Representation and Reasoning
Representing, analysing and managing web service protocols
Data & Knowledge Engineering - Special issue: ER 2004
SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Modeling Interactions of Web Software
WWV '06 Proceedings of the 2nd Int'l. Workshop on Automated Specification and Verification of Web Systems
Service oriented architectures: approaches, technologies and research issues
The VLDB Journal — The International Journal on Very Large Data Bases
A Calculus of Global Interaction based on Session Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Finite State Automata As Conceptual Model For E-Services
Journal of Integrated Design & Process Science
Timed Specification For Web Services Compatibility Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Verification of Web Services with Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Two session typing systems for higher-order mobile processes
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Fine-grained compatibility and replaceability analysis of timed web service protocols
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Checking Compatibility and Replaceability in Web Services Business Protocols with Access Control
ICWS '10 Proceedings of the 2010 IEEE International Conference on Web Services
When are two web services compatible?
TES'04 Proceedings of the 5th international conference on Technologies for E-Services
Hi-index | 0.00 |
Modeling Web services is a major step towards their automated analysis. One of the important parameters in this modeling, for the majority of Web services, is the time. A Web service can be presented by its behavior which can be described by a business protocol representing the possible sequences of message exchanges. To the best of the authors' knowledge, automated analysis of timed Web services e.g., compatibility and replaceability checking is very difficult and in some cases it is not possible with the presence of implicit transitions internal transitions based on time constraints. The semantics of the implicit transitions is the source of this difficulty because most of well-known modeling tools do not express this semantics e.g., epsilon transition on the timed automata has a different semantics. This paper presents an approach for converting any protocol containing implicit transitions to an equivalent one without implicit transitions before performing analysis.