rCOS: Theory and Tool for Component-Based Model Driven Development

Liu, Zhiming; Morisset, Charles; Stolz, Volker

doi:10.1007/978-3-642-11623-0_3

Cited by 29 publications

(29 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In particular, this correspondence gives the B[P , Ṗ ] formulas a semantics in terms of operators defined by rules in the format (24). The following proposition implies that the axioms of Boolean algebra are sound w.r.t.…”

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 93%

“…Q i and the transition relation − → γ inductively defined by the following rule in format (24) a ∈ γ q i…”

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 99%

“…Boolean characterisation of operators defined by rules in format (24) In [14], we have considered an algebra B[P , Ṗ ] of Boolean formulas over activation variables P and the firing variables Ṗ , with the additional axiom:…”

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 99%

“…In [14], we have established a correspondence between B[P , Ṗ ] and the glue operators defined by the rules in the format (24). For a rule r, denote A = i∈I a i and C = j∈ J c j .…”

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 99%

See 3 more Smart Citations

Offer semantics: Achieving compositionality, flattening and full expressiveness for the glue operators in BIP

Baranov

Bliudze

2015

Science of Computer Programming

View full text Add to dashboard Buy / Rent full text

Based on a concise but comprehensive overview of some fundamental properties required from component-based frameworks, namely compositionality, incrementality, flattening, modularity and expressiveness, we review three modifications of the semantics of glue operators in the Behaviour-Interaction-Priority (BIP) framework. We provide theoretical results and examples illustrating the degree to which the three semantics meet these requirements. In particular, we show that the most recent semantics, based on the offer predicate is the only one that satisfies all of them. The classical and offer semantics are not comparable: there are systems that can be assembled in the classical semantics, but not in the offer one. We present a strict characterisation of the behaviour hierarchy determining the conditions, under which systems in the classical semantics can be transposed into the offer semantics: directly, with minor modifications, by introducing a new type of synchronisation or cannot be transposed at all. The offer semantics allows us to extend the algebras, which are used to model glue operators in BIP, to encompass priorities. This extension uses the Algebra of Causal Interaction Trees, T (P ), as a pivot: existing transformations automatically provide the extensions for the Algebra of Connectors. We then extend the axiomatisation of T (P ), since the equivalence induced by the new operational semantics is weaker than that induced by the interaction semantics. This extension leads to canonical normal forms for all structures and to a simplification of the algorithm for the synthesis of connectors from Boolean coordination constraints.

show abstract

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 93%

“…Q i and the transition relation − → γ inductively defined by the following rule in format (24) a ∈ γ q i…”

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 99%

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 99%

“…In [14], we have established a correspondence between B[P , Ṗ ] and the glue operators defined by the rules in the format (24). For a rule r, denote A = i∈I a i and C = j∈ J c j .…”

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 99%

See 2 more Smart Citations

Offer semantics: Achieving compositionality, flattening and full expressiveness for the glue operators in BIP

Baranov

Bliudze

2015

Science of Computer Programming

View full text Add to dashboard Buy / Rent full text

show abstract

“…La démarche dans Kmelia est plus rattachée à la catégorie des modèles à composants tels que SOFA (Bures et al 2006), rCOS (Chen, Liu, Stolz, Yang et Ravn 2007, Liu, Morisset et Stolz 2009), Fractal (Bruneton et al 2006, BIP (Gossler et Sifakis 2005, Sifakis 2005). La composition est traitée de diverses façons selon les caractéristiques de l'approche considérée.…”

Section: Travaux Connexesunclassified

Kmelia, un modèle abstrait et formel pour la description et la composition de composants et de services

André¹,

Ardourel

Attiogbé

2011

Techniques et sciences informatiques

View full text Add to dashboard Buy / Rent full text

RÉSUMÉ. Kmelia est un langage et un modèle à composants multi-services où les composants sont abstraits et formels de façon à pouvoir y exprimer des propriétés et à les vérifier. Dans Kmelia un service peut interagir avec son appelant ; il peut encapsuler d'autres services auxquels il donne accès et aussi requérir d'autres services de son appelant ou non. Les services de Kmelia peuvent être paramétrés par des données et sont dotés d'assertions (sous la forme de pré/post-conditions opérant sur les données). Dans cet article nous présentons les principales caractéristiques de Kmelia à travers les moyens de composition de services et de composants qui sont offerts. La composition des composants et des services détermine les possibilités d'interaction ; nous présentons ainsi les différents cas d'interaction entre les services qui sont la base de la composition et des interactions. Nous présentons les méthodes d'analyse formelle élaborées en même temps que l'approche Kmelia et l'outil COSTO que nous développons. Nous illustrons l'article par l'étude de cas CoCoME consacrée à la gestion d'un site de vente de produits à distance.ABSTRACT. Kmelia is both a language and a multi-services component-based model. The Kmelia components are abstract and formal to permit the description and the verification of properties. Within Kmelia a service may interact with its caller ; it can encapsulate other services to which it gives access and it can also require services from its caller or from other components. The Kmelia services can be parameterised with data and they are equipped with assertions which are expressed as pre-post-/conditions operating on the data. In this article we introduce the main features of the Kmelia approach through the provided means for service composition and component composition. The composition of components and services determines the feasible interaction ; therefore we present the various cases of interaction between services which are the basis of composition and interaction. We present the formal analysis methods and the COSTO toolbox that accompany the Kmelia approach. The article is illustrated with the CoCoME example which deals with the management of a remote sale system.

show abstract

rCOS: Theory and Tool for Component-Based Model Driven Development

Cited by 29 publications

References 18 publications

Offer semantics: Achieving compositionality, flattening and full expressiveness for the glue operators in BIP

Offer semantics: Achieving compositionality, flattening and full expressiveness for the glue operators in BIP

Kmelia, un modèle abstrait et formel pour la description et la composition de composants et de services

Contact Info

Product

Resources

About