Connector Colouring I: Synchronisation and Context Dependency

Clarke, Dave; Costa, David de Oliveira; Arbab, Farhad

doi:10.1016/j.entcs.2005.12.035

Cited by 26 publications

(54 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A transition corresponding to a ∈ γ can fire iff at least one of the rules (29) has all its premises satisfied. In particular, this means that at least one of the monomials of ϕ a (see (28)) is satisfied, i.e. so is ϕ a .…”

Section: Properties Of Extended Bip Glue Operators In the Offer Semanmentioning

confidence: 99%

“…The approach we used in [13] for the Boolean encoding of connectors is close to that used for computing flows in Reo connectors in [26], where it is further extended to data flow. In [27], the authors discuss the extension of the colouring semantics of Reo [28] from the 2-colouring to the 3-colouring model. This extension is necessary to account for contextdependencies.…”

Section: Related Workmentioning

confidence: 99%

“…By grouping the monomials with the same positive variables, we have (28) with some γ ⊆ 2 P ∪Ṗ and, for each a ∈ γ , ϕ a is a purely negative formula on activation variables, i.e. a DNF formula, where all variables are negative.…”

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 99%

“…We proceed in three steps: 1) we associate to the set of rules a B[P , Ṗ ] formula ϕ as in (27); 2) we rewrite ϕ as in (28); 3) for each a ∈ γ , we rewrite the positive formula ϕ a in DNF. The set γ in (28), is the 7 Notice that 2…”

Section: Properties Of Extended Bip Glue Operators In the Offer Semanmentioning

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 Cite

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: Properties Of Extended Bip Glue Operators In the Offer Semanmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Definition 218 Two Extended Behavioursmentioning

confidence: 99%

Section: Properties Of Extended Bip Glue Operators In the Offer Semanmentioning

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 Cite

show abstract

“…Constraint automata [8] and connector colouring [9] provide the basis for both semantic models and implementations, as well as for model checking and visualisation tools for Reo. Constraint automata provide the semantics of each primitive and composition in Reo, by representing the synchronisation possible in a connector, along with a description of the data flow, in an automata-based model.…”

Section: Introductionmentioning

confidence: 99%

Deconstructing Reo

Clarke

Proença

Lazovik

et al. 2009

Electronic Notes in Theoretical Computer Science

Self Cite

View full text Add to dashboard Cite

Coordination in Reo emerges from the composition of the behavioural constraints of the primitives, such as channels, in a component connector. Understanding and implementing Reo, however, has been challenging due to interaction of the channel metaphor, which is an inherently local notion, and the non-local nature of constraint propagation imposed by composition. In this paper, the channel metaphor takes a back seat, and we focus on the behavioural constraints imposed by the composition of primitives, and phrase the semantics of Reo as a constraint satisfaction problem. Not only does this provide a clear intensional description of the behaviour of Reo connectors in terms of synchronisation and data flow constraints, it also paves the way for new implementation techniques based on constraint propagation and satisfaction. In fact, decomposing Reo into constraints provides a new computational model for connectors, which we extend to model interaction with an unknown external world beyond what is currently possible in Reo. de•con•struct verb [trans.]analyze (a text or linguistic or conceptual system) by deconstruction, typically in order to expose its hidden assumptions and contradictions and subvert its significance or unity.

show abstract

Service Orchestration with Priority Constraints

Changizi¹,

Kokash

Arbab

2019

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Cite

Business process management is an operational management approach that focuses on improving business processes. Business processes, i.e., collections of important activities in an organization, are represented in the form of a workflow, an orchestrated and repeatable pattern of activities amenable to automated analysis and control. Priority is an important concept in modeling workflows. We need priority to model cancelable and compensable tasks within transactional business processes. We use the Reo coordination language to model and formally analyze workflows. In this paper, we propose a constraint-based approach to formalize priority in Reo. We introduce special channels to propagate and block priority flows, define their semantics as constraints, and model priority propagation as a constraint satisfaction problem.

show abstract

Connector Colouring I: Synchronisation and Context Dependency

Cited by 26 publications

References 15 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

Deconstructing Reo

Service Orchestration with Priority Constraints

Contact Info

Product

Resources

About