An Interface Theory for Service-Oriented Design

Fiadeiro, José Luiz; Lopes, Antónia

doi:10.1007/978-3-642-19811-3_3

Cited by 7 publications

(16 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[29] for a comparison). Also the incorporation of asynchronous communication in synchronisation policies and the study of compatibility notions in this case [24,30] is a topic for future research. Moreover, appropriate notions of equivalences and refinements for team automata and how they behave w.r.t.…”

Section: Resultsmentioning

confidence: 99%

Communication Requirements for Team Automata

Beek

Carmona

Hennicker

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Compatibility of components is an important issue in the quest for systems of systems that guarantee successful communications, free from message loss and indefinite waiting for inputs. In this paper, we investigate compatibility in the context of systems consisting of reactive components which may communicate through the synchronised execution of common actions. We model such systems in the team automata framework, which does not impose any a priori restrictions on the synchronisation policy followed to combine the components. We identify a family of representative synchronisation types based on the number of sending and receiving components participating in synchronisations. Then, we provide a generic procedure to derive, for each synchronisation type, requirements for receptiveness and for responsiveness of team automata that prevent that outputs are not accepted and inputs are not provided, respectively. Due to the genericity of our approach w.r.t. synchronisation policies, we can capture compatibility notions for various multi-component system models known from the literature.

show abstract

Section: Resultsmentioning

confidence: 99%

Communication Requirements for Team Automata

Beek

Carmona

Hennicker

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The second aims at defining an operational semantics that captures the symbiosis that exists between execution and binding, i.e, where state executions within a network trigger the binding to another network, and where binding affects the execution of a network -a preliminary approach has been presented in (Chauchat, 2015). The third is to develop a logic and interface algebra for networks that is similar to the one presented in (Fiadeiro and Lopes, 2013) but adapted to a real-time context and reflecting run-time binding.…”

Section: Discussionmentioning

confidence: 99%

Dynamic networks of heterogeneous timed machines

Fiadeiro¹,

Lopes²,

Delahaye³

et al. 2017

Math. Struct. Comp. Sci.

Self Cite

View full text Add to dashboard Cite

We present an algebra of discrete timed input/output automata that may execute in the context of different clock granularities – which we call timed machines; this algebra includes a refinement operator through which a machine can be extended with new states and transitions in order to accommodate a finer clock granularity as required to interoperate with other machines, and an extension of the traditional product of timed input–output automata to the situation in which the granularities of the two machines are not the same. Over this algebra, we then define an algebra of networks of timed machines that includes operations through which networks can be modified at run time, thus offering a model for systems of interconnected components that can dynamically bind to other systems and, therefore, cannot be adjusted at design time to ensure that they operate in a timed homogeneous setting. We investigate important properties of timed machines such as consistency – in the sense that a machine can be ensured to generate a non-empty language, and feasibility – in the sense that a machine can be ensured to generate a non-empty language no matter what inputs it receives, and propose techniques for checking if timed machines are consistent or are feasible. We generalise those properties to networks of timed machines, and investigate how consistency and feasibility of networks can be proved through properties that can be checked at design time without having to compute, at run time, the product of the machines that operate on those networks, which would not be practical.

show abstract

“…We are also investigating t-closure over DTIOA in relation to traditional characterisations of safety properties over time sequences, e.g., nondeterministic Büchi automata [2]. This will allow us to use logics such as Safety MTL [17] to define an interface algebra for t-ARNs similar to [9,10] and investigate the use of model-checking techniques for validating orchestrations in relation to interfaces.…”

Section: Discussionmentioning

confidence: 99%

“…As in [9,10], two t-ARNs can be composed through the ports that are still available for establishing further interconnections, i.e., not connected to any other port, which we call interaction-points.…”

Section: Example Of a T-arn With Two Processes Connected Through A Chmentioning

confidence: 99%

“…In [9,10], we revisited the notions of interface and component algebra proposed in [7] for component-based design and put forward elements of a corresponding interface theory for service-oriented design in which service orchestrations are networks of asynchronously communicating processes. That algebra is based on an implicit model of time: the behaviour of processes and channels is captured by infinite sequences of sets of actions, each action consisting of either the publication or the delivery of a message.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Timed Component Algebra for Services

Delahaye

Fiadeiro

Legay

et al. 2013

Formal Techniques for Distributed Systems

Self Cite

View full text Add to dashboard Cite

Part 8: Session 7: Distribution and ConcurrencyInternational audienceWe present a component algebra for services that can guarantee time-related properties. The components of this algebra are networks of processes that execute according to time constraints and communicate asynchronously through channels that can delay messages. We characterise a sub-class of consistent networks give sufficient conditions for that class to be closed under composition. Finally, we show how those conditions can be checked, at design time, over timed I/O automata as orchestrations of services, thus ensuring that, when binding a client with a supplier service at run time, the orchestrations of the two services can work together as interconnected without further checks

show abstract

An Interface Theory for Service-Oriented Design

Cited by 7 publications

References 17 publications

Communication Requirements for Team Automata

Communication Requirements for Team Automata

Dynamic networks of heterogeneous timed machines

A Timed Component Algebra for Services

Contact Info

Product

Resources

About