Operating Guidelines for Finite-State Services

Lohmann, Niels; Massuthe, Peter; Wolf, Karsten

doi:10.1007/978-3-540-73094-1_20

Cited by 68 publications

(82 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Like Lohmann et al [18] and Stahl et al [30], we model open systems as open nets [33,18], thereby restricting ourselves to the communication protocol of an open system. An open net extends a net by an interface.…”

Section: Open Netsmentioning

confidence: 99%

Trace- and failure-based semantics for responsiveness

2014

View full text Add to dashboard Cite

Abstract.We study open systems modeled as Petri nets with an interface for asynchronous (i.e., buffered) communication with other open systems. As a minimal requirement for successful communication, we investigate responsiveness, which guarantees that an open system and its environment always have the possibility to communicate. We investigate responsiveness with and without final states and also their respective bounded variants, where the number of pending messages never exceeds a previously known bound. Responsiveness accordance describes when one open system can be safely replaced by another open system. We present a trace-based characterization for each accordance variant. As none of the relations turns out to be compositional (i.e., it is no precongruence), we characterize the coarsest compositional relation (i.e., the coarsest precongruence) that is contained in each relation, using a variation of should testing. For the two unbounded variants, the precongruences are not decidable, but for the two bounded variants we show decidability.

show abstract

Section: Open Netsmentioning

confidence: 99%

Trace- and failure-based semantics for responsiveness

2014

View full text Add to dashboard Cite

show abstract

“…2a, which is modeled as an open net [21,10]-that is, a Petri net extended with interface places positioned on a dashed frame around the net. The open net Public either sends message b and then receives d or sends message a and then receives c or d. A token on place p3 models successful termination, also indicated by the thicker bound of place p3.…”

Section: Motivating Examplementioning

confidence: 99%

“…We model services as open nets [21,10], thereby restricting ourselves to the communication protocol of a service. In the model, we abstract from data and identify each message by the label of its message channel.…”

Section: Open Netsmentioning

confidence: 99%

See 1 more Smart Citation

Conformance Checking of Services Using the Best Matching Private View

Müller

Aalst

Stahl

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We investigate whether a running implementation of a service conforms to its formal specification in a setting, where only recorded behavior of that implementation is given. Existing conformance checking techniques can be used to measure the degree of conformance of the recorded behavior and its public view but may produce "false negatives", because a correct implementation (i.e., private view ) may deviate significantly from its specification. The private view may, for example, reorder some activities without introducing any problems, yet traditional conformance checking would penalize such changes unjustifiably. To overcome this problem, we present a novel approach that determines a best matching private view. We show that among the infinitely many private views, there is a canonical best matching private view. While the represented theory is general and can be applied to arbitrary service models, the implementation is currently limited to acyclic service models.

show abstract

“…Note that state 1 is not a blocking state of A considered alone, since it is a final state. Modal specifications of services diverge notably from the operating guidelines for services introduced in [8] and further studied in [9], although they have much in common. Operating guidelines abstract from unobservable events, and they take final states into account for guaranteeing the absence of deadlock in the closed system formed by the service provider and the service requester.…”

Section: Definition 5 An Automatonmentioning

confidence: 99%

Supervisory Control for Modal Specifications of Services

Darondeau

Dubreil

Marchand

2010

IFAC Proceedings Volumes

View full text Add to dashboard Cite

In the service oriented architecture framework, a modal specification, as defined by Larsen in [6], formalises how a service should interact with its environment. More precisely, a modal specification determines the events that the server may or must allow at each stage in an interactive session. Therefore, techniques to enforce a modal specification on a system would be useful for practical applications. In this paper, we investigate the adaptation of the supervisory control theory of Ramadge and Wonham to enforce a modal specification (with final states marking the ends of the sessions) on a system modelled by a finite LTS. We prove that there exists at most one most permissive solution to this control problem. We also prove that this solution is regular and we present an algorithm for the effective computation of the corresponding controller.Key-words: discrete event systens, supervisory control, modal specifications, services, partial observation. Synthèse de contrôleurs pour des services décrits par des spécifications modalesRésumé : Dans le cadre d'une architecture orientée services, une spécification modale décrit les interactions possibles ou nécessaires entre un service et l'environnement utilisateur de ce service. Plus précisément, une spécification modale détermine les actions que le serveur peut ou doit permettreà son utilisateurà chaqueétape d'une session interactive. Développer des techniques de supervision permettant de forcer la conformité d'un systèmeà une spécification de service s'avère utile. Dans cet article, nous cherchonsà adapter les techniques de synthèse de contrôleurs afin de forcer la conformité de systèmes finisà des spécifications modales (avec desétats marquant les fins de sessions). Nous montrons que ce problème de contrôle a une plus grande solution. Nous montronségalement que cette solution est régulière et donnons un algorithme pour la calculer.

show abstract

Operating Guidelines for Finite-State Services

Cited by 68 publications

References 19 publications

Trace- and failure-based semantics for responsiveness

Trace- and failure-based semantics for responsiveness

Conformance Checking of Services Using the Best Matching Private View

Supervisory Control for Modal Specifications of Services

Contact Info

Product

Resources

About