Behavioral Constraints for Services

Lohmann, Niels; Massuthe, Peter; Wolf, Karsten

doi:10.1007/978-3-540-75183-0_20

Cited by 28 publications

(13 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This is done by comparing the requester's behavior to a subtree of the operating guideline with matching annotations. The authors extended their work in [52], in which they make a distinction between intended and unintended behavior to build customized operating guidelines. These customized operating guidelines characterizes all processes that can communicate deadlock freely with a given process satisfying a given constraint.…”

Section: Business Process Verification Approachesmentioning

confidence: 99%

A scenario-based verification technique to assess the compatibility of collaborative business processes

Backer

Snoeck

Monsieur

et al. 2009

Data & Knowledge Engineering

View full text Add to dashboard Cite

Section: Business Process Verification Approachesmentioning

confidence: 99%

A scenario-based verification technique to assess the compatibility of collaborative business processes

Backer

Snoeck

Monsieur

et al. 2009

Data & Knowledge Engineering

View full text Add to dashboard Cite

“…By restricting Ω C , domain knowledge and data dependencies are taken into account when checking feasibility and when constructing the configuration guideline. The idea to constrain the set of partners of an open net by adjusting its final marking is inspired by the concept of behavioral constraints presented in [28]. From the viewpoint of domain knowledge and data dependencies there is a considerable difference between allow x and hide x .…”

Section: Definition 14 (Translation Of Formulae Into a Set Of Final Mmentioning

confidence: 99%

Ensuring correctness during process configuration via partner synthesis

Aalst

Lohmann

Rosa

2012

Information Systems

Self Cite

View full text Add to dashboard Cite

Variants of the same process can be encountered within one organization or across different organizations. For example, different municipalities, courts, and rental agencies all need to support highly similar processes. In fact, procurement and sales processes can be found in almost any organization. However, despite these similarities, there is also the need to allow for local variations in a controlled manner. Therefore, many academics and practitioners have advocated the use of configurable process models (sometimes referred to as reference models). A configurable process model describes a family of similar process models in a given domain. Such a model can be configured to obtain a specific process model that is subsequently used to handle individual cases, for instance, to process customer orders. Process configuration is notoriously difficult as there may be all kinds of interdependencies between configuration decisions. In fact, an incorrect configuration may lead to behavioral issues such as deadlocks and livelocks. To address this problem, we present a novel verification approach inspired by the "operating guidelines" used for partner synthesis. We view the configuration process as an external service, and compute a characterization of all such services which meet particular requirements via the notion of configuration guideline. As a result, we can characterize all feasible configurations (i. e., configurations without behavioral problems) at design time, instead of repeatedly checking each individual configuration while configuring a process model.

show abstract

“…We call this state machine the monitor for C [9]. It unobtrusively monitors the interaction between the peers and reaches a final state iff the monitored conversation was part of the choreography.…”

Section: Synthesizing Realizing Peer Implementationsmentioning

confidence: 99%

Realizability Is Controllability

Lohmann

Wolf

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Behavioral Constraints for Services

Cited by 28 publications

References 14 publications

A scenario-based verification technique to assess the compatibility of collaborative business processes

A scenario-based verification technique to assess the compatibility of collaborative business processes

Ensuring correctness during process configuration via partner synthesis

Realizability Is Controllability

Contact Info

Product

Resources

About