Results 1 - 10 of 482

Decidability results for choreography realization

by Niels Lohmann, Karsten Wolf
"... 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
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

Deciding choreography realizability

by Samik Basu, Tevfik Bultan, Meriem Ouederni , 2012
"... Since software systems are becoming increasingly more concurrent and distributed, modeling and analysis of interactions among their components is a crucial problem. In several application domains, message-based communication is used as the interaction mechanism, and the communication contract among ..."
Abstract - Cited by 15 (4 self) - Add to MetaCart
for several years and it was not known if this was a decidable problem. In this paper we give necessary and sufficient conditions for realizability of choreographies. We implemented the proposed realizability check and our experiments show that it can efficiently determine the realizability of 1) web service

Describing the uncertainties in experimental results

by Robert J. Moffat - Experimental Thermal and Fluid Science , 1998
"... I I It is no longer acceptable, in most circles, to present experimental results without describing the uncertainties involved. Besides its obvious role in pub-lishing, uncertainty analysis provides the experimenter a rational way of eval-uating the significance of the scatter on repeated trials. Th ..."
Abstract - Cited by 281 (2 self) - Add to MetaCart
. This can be a powerful tool in locating the source of trouble in a misbehaving experiment. To the user of the data, a statement (by the experimenter) of the range within which the results of the present experiment might have fallen by chance alone is of great help in deciding whether the present data agree

Automatic Choreography Repair

by Samik Basu, Tevfik Bultan
"... Abstract. Choreography analysis is a crucial problem in concurrent and distributed system development. A choreography specifies the desired ordering of message exchanges among the components of a system. The realizability of a choreography amounts to determining the existence of components whose com ..."
Abstract - Add to MetaCart
communication behavior conforms to the given choreography. Recently, the choreography realizability problem has been proved to be decidable. In this paper, we investigate the repairability of un-realizable choreographies, where the goal is to identify a set of changes to a given un-realizable choreography

Non-desynchronizable Service Choreographies

by Gero Decker, Alistair Barros, Frank Michael Kraft, Niels Lohmann
"... 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
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

Semantic Conflict Prevention in Service Choreography

by Young Yoon, Chunyang Ye, Hans-arno Jacobsen
"... Abstract. The choreography of business processes deployed across different organizations on large-scale enterprise networks is prone to producing semantically conflicting behavior. For example, increasing production is inconsistent with a sales promotion given the business goal of clearing out the i ..."
Abstract - Add to MetaCart
specification by introducing extra coordination mechanisms. We prove that the resulting global specification can be realized by a set of local specifications that guarantee consistent behavior among partners. Experimental results show that our approach is promising in preventing semantic conflicts

Decidability of String Graphs

by Marcus Schaefer, Daniel Stefankovic - Proceedings of the 33rd Annual Symposium on the Theory of Computing , 2003
"... We show that string graphs can be recognized in nondeterministic exponential time by giving an exponential upper bound on the number of intersections for a minimal drawing realizing a string graph in the plane. This upper bound confirms a conjecture by Kratochvl and Matousek [KM91] and settles th ..."
Abstract - Cited by 34 (5 self) - Add to MetaCart
the long-standing open problem of the decidability of string graph recognition (Sinden [Sin66], Graham [Gra76]). Finally we show how to apply the result to solve another old open problem: deciding the existence of Euler diagrams, a fundamental problem of topological inference (Grigni, Papadias

Parallel Web Service Composition in MoSCoE: A Choreography-based Approach

by Jyotishman Pathak, Samik Basu , Robyn Lutz, Vasant Honavar - IN 4TH IEEE EUROPEAN CONFERENCE ON WEB SERVICES , 2006
"... We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete functional specification of a desired goal service. This specification is used to compose a choreographer that allows communic ..."
Abstract - Cited by 18 (14 self) - Add to MetaCart
reformulate the goal to reduce the ‘gap between the desired functionality. The process can be iterated until a feasible composition is realized or the user decides to abort. The approach ensures that (i) a choreographer, if one is produced by our composition algorithm, in fact realizes the user

Realizability of Real-Time Logics

by L. Doyen, G. Geeraerts, J.-F. Raskin, J. Reichert
"... We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metric Interval Temporal Logic), a logic for which the satisfiability and validity problems are decidable, a necessary condition for t ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metric Interval Temporal Logic), a logic for which the satisfiability and validity problems are decidable, a necessary condition

Creative Commons Attribution License. Choreographies with Secure Boxes and Compromised Principals

by Marco Carbone, Joshua Guttman
"... We equip choreography-level session descriptions with a simple abstraction of a security infrastruc-ture. Message components may be enclosed within (possibly nested) ”boxes ” annotated with the intended source and destination of those components. The boxes are to be implemented with cryp-tography. S ..."
Abstract - Add to MetaCart
-tography. Strand spaces provide a semantics for these choreographies, in which some roles may be played by compromised principals. A skeleton is a partially ordered structure containing local behaviors (strands) executed by regular (non-compromised) principals. A skeleton is realized if it contains enough regular
Results 1 - 10 of 482