Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2006
Abstract In this paper we present an approach for modelling and analyzing time-related properties of Web service compositions defined as a set of BPEL4WS processes. We introduce a formalism, called Web service timed state transition systems (WSTTS), to capture the timed behavior of the composite Web services. We also exploit an interval temporal logic to express complex timed assumptions and requirements on the system's behavior.
2005
Abstract. In this paper we present an approach for modelling and analyzing time-related properties of Web service compositions defined as a set of BPEL4WS processes. We introduce a formalism, called Web Service Timed State Transition Systems (WSTTS), to capture the timed behavior of the composite web services. We also exploit an interval temporal logic to express complex timed assumptions and requirements on the system's behavior.
In this paper we address the problem of qualitative and quantitative analysis of timing aspects of Web service compositions defined as a set of BPEL4WS processes. We introduce a formalism, called Web Service Timed State Transition Systems (WSTTS), to capture the timed behavior of the composite web services. We also exploit an interval temporal logic to express complex timed assumptions and requirements on the system's behavior. Building on top of this formalization, we provide techniques and tools for modelchecking BPEL4WS compositions against time-related requirements. We also present a symbolic algorithm that can be used to compute duration bounds of behavioral intervals that satisfy such requirements. We perform a preliminary experimental evaluation of our approach and tools with the help of an e-Government case study.
2006
In this paper we address the problem of qualitative and quantitative analysis of timing aspects of Web service compositions defined as a set of BPEL4WS processes. We introduce a formalism, called Web Service Timed State Transition Systems (WSTTS), to capture the timed behavior of the composite web services. We also exploit an interval temporal logic to express complex timed assumptions and requirements on the system's behavior. Building on top of this formalization, we provide techniques and tools for modelchecking BPEL4WS compositions against time-related requirements. We also present a symbolic algorithm that can be used to compute duration bounds of behavioral intervals that satisfy such requirements. We perform a preliminary experimental evaluation of our approach and tools with the help of an e-Government case study.
International Journal of Business Process Integration and Management, 2017
This paper introduces a method to analyse and verify the BPEL language. We propose a transformation approach based on the translation of BPEL descriptions to the communicating durational action timed automata (C-DATA) model which is a distributed, real-time semantic model that is based on true-concurrency semantics and supports the distributed and the communicating aspects. In order to handle compositions of multiple web services and exchanged messages between them we represent each BPEL service by a local C-DATA, while the global system is represented by all these local C-DATAs. These local C-DATAs communicate with each other by exchanging messages through communication channels. This approach considers both timing constraints and interaction durations between web services.
2006
Abstract In this paper we address the problem of qualitative and quantitative analysis of timing aspects of Web service compositions defined as a set of BPEL4WS processes. We introduce a formalism, called Web service timed state transition systems (WSTTS), to capture the timed behavior of the composite Web services. We also exploit an interval temporal logic to express complex timed assumptions and requirements on the system's behavior.
2005
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.
International Computer Software and Applications Conference, 2008
Runtime monitoring is significantly essential for web service compositions. For a kind of composite services, nonfunctional properties, such as timed properties, are as important as functional properties and need to be monitored in runtime. In this paper, we extend Property Sequence Chart into timed Property Sequence Chart and propose a new approach to monitor two kinds of timed properties in web service compositions: the accomplished time of basic service operations and some additional timed assumptions of the composition process. Our approach is more intuitive than traditional monitoring approaches.
Lecture Notes in Computer Science, 2013
Ensuring reliability in Web service compositions is of crucial interest as services are composed and executed in long-running, distributed mediums that cannot guarantee reliable communications. Towards this, transactional behavior has been proposed to handle and undo the effects of faults of individual components. Despite significant research interest, challenges remain in providing an easy-to-use, formal approach to verify transactional behavior of Web service compositions before costly development. In this paper, we propose the use of temporal logic templates to specify component-level and composition-level transactional requirements over a Web service composition. These templates are specified using a simple format, configured according to scope and cardinality, and automatically translated into temporal logic. To verify design conformance to a set of implemented templates, we employ model checking. We propose an algorithm to address state space explosion by reducing the models into semantically equivalent Kripke structures. Our approach facilitates the implementation of expressive transactional behavior onto existing complex services, as demonstrated in our experimental study.
2013
WS-BPEL is way to orchestrate web services. It defines business processes that interact with external entities through web service operations using WSDL. The existing system defines service flow using Web Services based on WSDL. We have proposed BPEL-TC, an extension to existing WS-BPEL which uses temporally customized Web Services as a model for process decomposition and assembly. WSDL-TC handles both backward compatible and incompatible changes and also maintains various versions of the artifacts that results due to changes over time and customizations desired by the users. A formal representation of BPEL-TC is also presented using Kleene Algebra with Test (KAT).
2011
Abstract This paper presents a methodology for generating a web service" stub" that simulates the behaviour of a real-world SOAP web service. The simulation is driven by a formal description of the original service's input and output parameters, messages, and ordering constraints between messages, using an extension of Linear Temporal Logic called LTL-FO+.
International Journal on Semantic Web and Information Systems
This article describes how incorporating temporal constraints in web service composition results in more complex models and makes the verification of temporal consistency during the modeling and execution crucial. This article proposes a model named H-Service-Net based on the time petri net model to control and manage temporal consistency; the model also supports time constraints and exception handling. First, this approach proposes a modular approach for modeling composition using Extend Time Unit System, Allen's interval algebra, and comparison operators in a time petri net model to consider all types of temporal constraints. Subsequently, this article presents algorithms on checking temporal consistency and mechanism for exception handling and validating the system in an implementation tool (H-Service-Editor) based on the proposed approach that uses BizTalk Server 2013 to evaluate the implementation of temporal constraints and timeout exception handling. Finally, an exhaustiv...
Proceedings of the 17th International Conference on Enterprise Information Systems, 2015
Web service composition is studied by many works, and constitutes the heart of a great research activity. However, the majority of this work does not take into account all temporal constraints imposed by the service provider and the users in the composition process. Incorporating temporal constraints in Web service composition result in more complex model and make crucial the verification of temporal consistence during the modeling (at design time) and then during the execution (at run time). In this paper, we presented H-Service-Net model for Web service composition with time constraints, and propose a modular approach for modeling composition with time constraint using Extend time unit system (XTUS), Allen's interval algebra and comparison operators in a time Petri net model.
Web Services, 2009. …, 2009
Current Web service composition approaches and languages such as WS-BPEL do not allow to define temporal constraints in a declarative and separate way. Also it is not possible to verify if there are contradictions between the temporal constraints implemented in the composition. These limitations lead to maintainability and correctness problems. In this paper, we tackle these problems through a novel approach to temporal constraints in Web service compositions, which combines formal methods and aspect-oriented programming. In this approach, we use a powerful and expressive formal language, called XTUS-Automata, for specifying time-related properties and we introduce specification patterns that ease the definition of such constraints. The formal specifications are translated automatically into AO4BPEL aspects, which ensure the runtime monitoring of the temporal constraints. Our approach enables a declarative, separate, and verifiable specification of temporal properties and it generates automatically modular enforcement code for those properties.
Asia-Pacific Web Conference, 2008
Keeping composite services satisfying desired properties has been widely accepted as an important and challenging problem due to the dynamically evolving attribute of web service compositions. Runtime monitoring and dynamic verification techniques become first class activities to be performed during the execution of web service compositions. Scenario-based temporal properties depicting the complex interactions among the different services are a kind of important property which needs to be monitored at runtime. However, some complex scenario-based temporal properties cannot be easily represented by the traditional formalism such as temporal logic. In this paper, we first propose to represent the scenario-based temporal properties of web service compositions by the use of a novel notation (Property Sequence Chart). Then, we use Aspect-Oriented Programming techniques to extend the open-source BPEL engine (ActiveBPEL) and monitor its execution. Based on these assumptions, we propose a more intuitive approach to monitor the scenario-based temporal properties in web service compositions.
ScienceRise, 2015
Issues related to improving the design of multiservice SOA networks are discussed. Issue of creation of complex services, their orchestration and choreography are considered. Problem arising when creating an integrated service is discussed. It is shown that the formal description of the service using temporal logics will perform rigorous verification service and eliminate design errors
2014
It is widely recognized that temporal aspects are indispensable for Web Service modeling. Unfortunately, the current Semantic web Services description languages suffer from the lack of useful concepts needed for timing description. For this purpose, we propose a global methodology for the specification of timing behavior with an extended OWL-S ontology and verification of temporal properties with UPPPAL tool. The applicability is illustrated through the multimodal transport use case.
SIMULATION, 2012
In this paper we introduce a tool called the Web Service Translation tool (WST), which we are developing to implement a methodology for the design, validation and verification of Web Services with timed restrictions. This methodology works by making several translations, from phase to phase in the software development life cycle, where the system is represented at each phase by XML models. We use XSL Transformations (XSLT), which is a language for transforming XML documents. The purpose of these translations is to generate XML code automatically for a Web Service system and to obtain Web Services description models with Timed Automata for validating and verifying composite Web Services with time restrictions.
2011
1 -Time is an important parameter in modeling and analyzing Web services. A Web service can be represented by its behavior which can be described by a business protocol representing the possible sequences of message exchanges. Automated analyses of timed Web services, such as compatibility checking, are very difficult and in some cases are not possible in the presence of implicit transitions (internal transitions) based on time constraints. The source of this difficulty is the semantics of implicit transitions, because most of the wellknown modeling tools do not allow expressing such semantics (e.g., epsilon transition on timed automata has different semantics). This paper presents an approach for removing complex implicit transitions of timed business protocols before performing the interoperability analysis without changing the semantics of the protocols.
The Journal of Logic and Algebraic Programming, 2011
We present an approach for the validation and verification of Web services choreographies, and more specifically, for those composite Web services systems with timing restrictions. We use a W3C proposal for the description of composite Web services, WS-CDL (Web Services Choreography Description Language), and we define an operational semantics for a relevant subset of it. We then define a translation of the considered subset of WS-CDL into a network of timed automata, proving that this translation is correct. Finally, we use the UPPAAL tool for the validation and verification of the described system, by using the generated timed automata.