Compatibility in a multi-component environment

Carmona, Josep; Kleijn, Jetty

doi:10.1016/j.tcs.2013.03.006

Cited by 15 publications

(45 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CFSMs [7], the BIP framework [3,13], team automata [8], component-interaction automata [9], and modal assemblies [15]. So it is an interesting question to what extent the concepts and laws from above appear in the different frameworks.…”

Section: Independent Implementability: Let a B ∈ A Such That A B Andmentioning

confidence: 99%

“…BIP provides, as required for an assembly theory, a composition operator, it deals with certain properties of systems, like interaction safety, and focuses on compositionality results much in the spirit of an assembly theory. Compositionality results are also studied in [8] for systems of reactive transition systems (playing the role of interfaces). Our notion of an assembly could be instantiated by the concept of a composable system, and communication-safety by the notion of a compatible system.…”

Section: Independent Implementability: Let a B ∈ A Such That A B Andmentioning

confidence: 99%

“…Different synchronization strategies are applicable and interpreted via team automata. For the case of the synchronous product, [8] shows, in Cor. 9, a compositionality result, which is very similar to property (A2) required for assembly theories.…”

Section: Independent Implementability: Let a B ∈ A Such That A B Andmentioning

confidence: 99%

“…The specification of networks of components with arbitrarily (finitely) many members and their interactions is supported by BIP [3,13] as well as by other formalisms for modeling distributed component systems, like CFSMs [7], team automata [8], component-interaction automata [9], or modal assemblies [15].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Assembly Theories for Communication-Safe Component Systems

Hennicker

Knapp

Wirsing

2014

From Programs to Systems. The Systems Perspective in Computing

View full text Add to dashboard Cite

Abstract.We propose an abstract notion of an assembly theory that formalizes rudimentary requirements for systems of interacting components. Among these are a composition operator for assemblies, a communication-safety predicate to express the absence of communication errors, a refinement relation for assemblies, and a packing operation to encapsulate assemblies into components thus allowing hierarchical system constructions. We establish laws that must be satisfied by any concrete assembly theory in order to support compositionality of communication-safety, of encapsulation and of refinement. Moreover, refinement must behave well w.r.t. communication-safety and encapsulation. As a concrete instance we investigate a modal assembly theory using modal I/O-interfaces (MIOs) for modeling observable component behaviors and MIOs with possible error states (indicating communication errors) for modeling assembly behaviors. We show that all rules of an assembly theory are satisfied by modal assemblies, in particular the compositionality requirements hold.

show abstract

Section: Independent Implementability: Let a B ∈ A Such That A B Andmentioning

confidence: 99%

Section: Independent Implementability: Let a B ∈ A Such That A B Andmentioning

confidence: 99%

Section: Independent Implementability: Let a B ∈ A Such That A B Andmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Assembly Theories for Communication-Safe Component Systems

Hennicker

Knapp

Wirsing

2014

From Programs to Systems. The Systems Perspective in Computing

View full text Add to dashboard Cite

show abstract

“…In [16], the binary notion of I/O compatibility from [11,12] was lifted to team automata consisting of multiple reactive component automata. The aim of the ideas developed in [12] was to provide a formal framework for the synthesis of asynchronous circuits and embedded systems.…”

Section: Introductionmentioning

confidence: 99%

Conditions for Compatibility of Components

Beek

Carmona

Kleijn

2016

Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques

Self Cite

View full text Add to dashboard Cite

We consider systems composed of reactive components that collaborate through synchronised execution of common actions. These multi-component systems are formally represented as team automata, a model that allows a wide spectrum of synchronisation policies to combine components into higher-level systems. We investigate the correct-by-construction engineering of such systems of systems from the point of view of correct communications between the components (no message loss or deadlocks due to indefinite waiting). This leads to a proposal for a generic definition of compatibility of components relative to the adopted synchronisation policy. This definition appears to be particularly appropriate for so-called master-slave synchronisations by which input actions (for 'slaves') are driven by output actions (from 'masters').

show abstract