Operating Guidelines - an Automata-Theoretic Foundation for the Service-Oriented Architecture

Massuthe, Peter; Schmidt, Karsten

doi:10.1109/qsic.2005.47

Cited by 24 publications

(23 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A composition is then considered sound if it contains no deadlocks. In [15] the authors use the alternative soundness notion of weak termination [16], which captures the idea that the each partner should correctly terminate.…”

Section: A Service Automatamentioning

confidence: 99%

See 1 more Smart Citation

Privacy preserving business process matching

Gurov

Laud

Guanciale

2015

2015 13th Annual Conference on Privacy, Security and Trust (PST)

View full text Add to dashboard Cite

Business process matching is the activity of checking whether a given business process can interoperate with another one in a correct manner. In case the check fails, it is desirable to obtain information about how the first process can be corrected with as few modifications as possible to achieve interoperability. In case the two business processes belong to two separate enterprises that want to build a virtual enterprise, business process matching based on revealing the business processes poses a clear threat to privacy, as it may expose sensitive information about the inner operation of the enterprises. In this paper we propose a solution to this problem for business processes described by means of service automata. We propose a measure for similarity between service automata and use this measure to devise an algorithm that constructs the most similar automaton to the first one that can interoperate with the second one. To achieve privacy, we implement this algorithm in the programming language SECREC, executing on the SHAREMIND platform for secure multiparty computation. As a result, only the correction information is leaked to the first enterprise and no more.

show abstract

Section: A Service Automatamentioning

confidence: 99%

“…Several formal modeling languages such as Petri Nets [8], [26], Service Automata [15] and process algebra [9] have been proposed, allowing to formally state soundness properties such as weak termination [16] and deadlock freedom [15], and to formulate algorithms to check these properties.…”

Section: Introductionmentioning

confidence: 99%

Privacy preserving business process matching

Gurov

Laud

Guanciale

2015

2015 13th Annual Conference on Privacy, Security and Trust (PST)

View full text Add to dashboard Cite

show abstract

“…This is the case of annotated automata [24] and operating guidelines [21,19]. While both formalisms have a product (or parallel) composition operator, they are missing the optimistic view of composition and also the conjunction operator that turns out to be instrumental as soon as components are described according to several distinct but interacting viewpoints [23].…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Ensuring Reachability by Design

Caillaud

Raclet

2012

Theoretical Aspects of Computing – ICTAC 2012

View full text Add to dashboard Cite

Modular design aims at decomposing systems as a set of distinct components that can be independently developed and then assembled all together. Interfaces are then attached to components; they abstract implementation details while exposing to the environment relevant information about cross-component interactions. Whereas state-of-the-art on interfaces essentially consider independent implementability of safety properties, we consider in this paper reachability properties, which are in general not compositional. The approach we advocate consists in controlling the design flow of components, that is, the evolution of their interfaces through combinations and refinements, in order to ensure a reachability property by construction. Modal specifications are widely acknowledged as a suitable specification formalism for interfacebased design. In order to obtain the required expressivity, we extend them with marked states to model states to be reached. We then develop an algebra with both logical and structural composition operators ensuring reachability properties by design.

show abstract

“…In the following we recapitulate our concept of an operating guideline [10,5]. With the help of an operating guideline we are able to represent the set of all strategies M for an open net N in a compact way.…”

Section: Operating Guidelinesmentioning

confidence: 99%