Results 1 - 10
of
21
A data-centric design methodology for business processes
- Handbook of Research on Business Process Modeling, chapter 23
, 2009
"... This chapter describes a design methodology for business processes and workflows that focuses first on “business artifacts”, which represent key (real or conceptual) business entities, including both the business-relevant data about them and their macro-level lifecycles. Individual workflow services ..."
Abstract
-
Cited by 27 (4 self)
- Add to MetaCart
(Show Context)
This chapter describes a design methodology for business processes and workflows that focuses first on “business artifacts”, which represent key (real or conceptual) business entities, including both the business-relevant data about them and their macro-level lifecycles. Individual workflow services (a.k.a. tasks) are then incorporated, by specifying how they operate on the artifacts and fit into their lifecycles. The resulting workflow is specified in a particular artifact-centric workflow model, which is introduced using an extended example. At the logical level this workflow model is largely declarative, in contrast with most traditional workflow models which are procedural and/or graph-based. The chapter includes a discussion of how the declarative, artifact-centric workflow specification can be mapped into an optimized physical realization. 1.
Realizability is controllability
"... Abstract. A choreography describes the interaction between services. It may be used for specification purposes, for instance serving as a contract in the design of an interorganizational business process. Typically, not all describable interactions make sense which motivates the study of the realiza ..."
Abstract
-
Cited by 17 (4 self)
- Add to MetaCart
(Show Context)
Abstract. A choreography describes the interaction between services. It may be used for specification purposes, for instance serving as a contract in the design of an interorganizational business process. Typically, not all describable interactions make sense which motivates the study of the realizability problem for a given choreography. In this paper, we show that realizability can be traced back to the problem of controllability which askes whether a service has compatible partner processes. This way of thinking makes algorithms for controllability available for reasoning about realizability. In addition, it suggests alternative definitions for realizability. We discuss several proposals for defining realizability which differ in the degree of coverage of the specified interaction. 1
Non-desynchronizable Service Choreographies
"... A precise definition of interaction behavior between services is a prerequisite for successful business-to-business integration. Service choreographies provide a view on message exchanges and their ordering constraints from a global perspective. Assuming message sending and receiving as one atomic s ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
A precise definition of interaction behavior between services is a prerequisite for successful business-to-business integration. Service choreographies provide a view on message exchanges and their ordering constraints from a global perspective. Assuming message sending and receiving as one atomic step allows to reduce the modelers’ effort. As downside, problematic race conditions resulting in deadlocks might appear when realizing the choreography using services that exchange messages asynchronously. This paper presents typical issues when desynchronizing service choreographies. Solutions from practice are discussed and a formal approach based on Petri nets is introduced for identifying desynchronizable choreographies.
An Interface Theory for Service-Oriented Design
"... Abstract. We put forward an interface and component algebra through which we characterise fundamental structures that support service-oriented design independently of the specific formalisms that may be adopted to provide models for languages or analysis tools. We view services as an interface mecha ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
(Show Context)
Abstract. We put forward an interface and component algebra through which we characterise fundamental structures that support service-oriented design independently of the specific formalisms that may be adopted to provide models for languages or analysis tools. We view services as an interface mechanism that can be superposed over a component infrastructure, what is sometimes referred to as a ‘service overlay’. The component algebra consists of networks of processes that interact asynchronously through communication channels. A service interface offers properties to potential clients and requires properties of external services that, at run time, may need to be discovered and bound to the orchestration of the service. We define what it means for an asynchronous relational net to orchestrate a service interface and prove a number of compositionally results that relate the operations of both algebras. One of the major results of the paper is the characterisation of a sub-class of asynchronous relational nets over which we can guarantee that, when binding, through their interfaces, a client and a supplier service, the composition of the orchestrations of the two services is consistent, i.e., both services can work together as interconnected. 1
Decidability results for choreography realization
"... Abstract. A service choreography defines a set of permitted sequences of message events as a specification for the interaction of services. Realizability is a fundamental sanity check for choreographies comparable to the notion of soundness for workflows. We study several notions of realizability: p ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
(Show Context)
Abstract. A service choreography defines a set of permitted sequences of message events as a specification for the interaction of services. Realizability is a fundamental sanity check for choreographies comparable to the notion of soundness for workflows. We study several notions of realizability: partial, distributed, and complete realizability. They establish increasingly strict conditions on realizing services. We investigate decidability issues under the synchronous and asynchronous communication models. For partial realizability, we show undecidability whereas the other two problems are decidable with reasonable complexity. 1
Declarative choreographies for artifacts
- In ICSOC
"... Abstract. A choreography models a collaboration between multiple participants. Existing choreography specification languages focus mostly on message sequences and are weak in modeling data shared by participants and used in sequence con-straints. They also assume a fixed number of participants and m ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
(Show Context)
Abstract. A choreography models a collaboration between multiple participants. Existing choreography specification languages focus mostly on message sequences and are weak in modeling data shared by participants and used in sequence con-straints. They also assume a fixed number of participants and make no distinction between participant type and participant instances. Artifact-centric business pro-cess models give equal considerations on modeling data and on control flow of activities. These models provide a solid foundation for choreography specifica-tion. This paper makes two contributions. First, we develop a choreography lan-guage for artifacts with four new features: (1) Each participant type is an artifact schema with (a part of) its information model accessible by choreography spec-ification. (2) Instance level correlations are supported and cardinality constraints on correlation of participant instances are explicitly defined. (3) Messages have data models, both message data and artifact data can be used in specifying chore-ography constraints. (4) The language is declarative based on a mixture of first order logic and a set of binary operators from DecSerFlow. Second, we develop a realization mechanism and show that a subclass of the choreography specified in our language can always be realized. The mechanism consists of a coordinator running with each artifact instance and a message protocol among participants. 1
A Petri Net Approach to Synthesize Intelligible State Machine Models from Choreography
- IN: INTERNATIONAL WORKSHOP ON PETRI NETS AND SOFTWARE ENGINEERING
, 2012
"... Application of service-oriented architecture, which builds the entire system by a combination of independent software components, to a wide variety of computer systems is expected. The problem to synthesize state machine models of the services from a communication diagram representing the overall ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Application of service-oriented architecture, which builds the entire system by a combination of independent software components, to a wide variety of computer systems is expected. The problem to synthesize state machine models of the services from a communication diagram representing the overall specifications of service interaction is known as the choreography realization problem. It should be minded on automatic synthesis that software models should be simple to be understood easily by software engineers. In this paper, we propose a method to synthesize hierarchical state machine models for the choreography realization problem. The proposed method is evaluated using a metric for intelligibility.
Analysis and Verification of Service Interaction Protocols -- A Brief Survey
, 2010
"... Modeling and analysis of interactions among services is a crucial issue in Service-Oriented Computing. Composing Web services is a complicated task which requires techniques and tools to verify that the new system will behave correctly. In this paper, we first overview some formal models proposed in ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Modeling and analysis of interactions among services is a crucial issue in Service-Oriented Computing. Composing Web services is a complicated task which requires techniques and tools to verify that the new system will behave correctly. In this paper, we first overview some formal models proposed in the literature to describe services. Second, we give a brief survey of verification techniques that can be used to analyse services and their interaction. Last, we focus on the realizability and conformance of choreographies.
A Tool to Synthesize Intelligible State Machine Models from Choreography using Petri Nets
"... Application of service-oriented architecture, which builds the entire system by a combination of independent software components, to a wide variety of computer systems is expected. The problem to synthesize state machine models of the services from a communication diagram representing the overall sp ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Application of service-oriented architecture, which builds the entire system by a combination of independent software components, to a wide variety of computer systems is expected. The problem to synthesize state machine models of the services from a communication diagram representing the overall specifications of service interaction is known as the choreography realization problem. It should be minded on automatic synthesis that software models should be simple to be understood easily by software engineers. We have proposed a method to synthesize hierarchical state machine models for the choreography realization problem in the last PNSE. In this paper, we present a prototypical tool for the method.
A logic-programming semantics of services
- Algebra and Coalgebra in Computer Science
"... Abstract. We develop formal foundations for notions and mechanisms needed to support service-oriented computing. Our work provides semantics for the service overlay by abstracting concepts from logic programming. It draws a strong anal-ogy between the discovery of a service that can be bound to a cl ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. We develop formal foundations for notions and mechanisms needed to support service-oriented computing. Our work provides semantics for the service overlay by abstracting concepts from logic programming. It draws a strong anal-ogy between the discovery of a service that can be bound to a client application and the search for a clause that can be used for computing an answer to a query. In addition, it describes the process of binding services and the reconfiguration of applications as service-oriented derivatives of unification and resolution. 1
