Channel-based coordination via constraint satisfaction

Clarke, Dave; Proença, José; Lazovik, Alexander; Arbab, Farhad

doi:10.1016/j.scico.2010.05.004

Cited by 25 publications

(36 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In previous work we showed how to encode connector colouring as constraints [9]. The constraints encode three aspects of behaviour: synchronisation constraints (SC) describe the presence or absence of data flow at each end-that is, whether or not those ends synchronise; data flow constraints (DFC) describe the data flow at the ends that synchronise (which connector colouring does not capture); and context constraints (CC) describe the direction of the reasons for no-flow.…”

Section: Constraint-based Encodingmentioning

confidence: 99%

“…Table 2 presents the semantics of some commonly used primitives. A solution to a formula ψ is an assignment of variables, defined in the usual manner [9].…”

Section: Constraint-based Encodingmentioning

confidence: 99%

“…Partial connector colouring is implemented using constraint satisfaction in a fashion similar to our constraint-based implementation of Reo [9]. The previous implementation collected all the constraints for a connector and solved them.…”

Section: Implementation and Benchmarksmentioning

confidence: 99%

“…The models are all distinct-and the relationship between them has not been investigated-but for our purposes, we do not consider automata-based models as these do not lead to scalable implementations. The constraint-based encoding of Reo [9] offers orders of magnitude improvement in performance and scalability of Reo implementations.…”

Section: Related Workmentioning

confidence: 99%

“…Thirdly, the semantics were simple enough to enable a straightforward implementation of Reo [4]. Further improvements in implementation efficiency were obtained by encoding connector colouring as constraints and using SAT and constraint satisfaction techniques [9].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Partial Connector Colouring

Clarke

Proença

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Connector colouring provided an intuitive semantics of Reo connectors which lead to effective implementation techniques, first based on computing colouring tables directly, and later on encodings of colouring into constraints. One weakness of the framework is that it operates globally, giving a colouring to all primitives of the connector in lock-step, including those not involved in the interaction. This global approach limits both scalability and the available concurrency. This paper addresses these problems by introducing partiality into the connector colouring model. Partial colourings allow parts of a connector to operate independently and in isolation, increasing scalability and concurrency.

show abstract

Section: Constraint-based Encodingmentioning

confidence: 99%

“…Table 2 presents the semantics of some commonly used primitives. A solution to a formula ψ is an assignment of variables, defined in the usual manner [9].…”

Section: Constraint-based Encodingmentioning

confidence: 99%

Section: Implementation and Benchmarksmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Partial Connector Colouring

Clarke

Proença

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

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

Coordinating Multicore Computing

Arbab

Jongmans

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Traditional models of concurrency resort to peculiarly indirect means to express interaction and study its properties. Formalisms such as process algebras/calculi, concurrent objects, actors, shared memory, message passing, etc., all are primarily action-based models that provide constructs for the direct specification of things that interact, rather than a direct specification of interaction (protocols). Consequently, interaction in these formalisms becomes a derived or secondary concept whose properties can be studied only indirectly, as the sideeffects of the (intended or coincidental) couplings or clashes of the actions whose compositions comprise a model.Treating interaction as an explicit first-class concept, complete with its own composition operators, allows to specify more complex interaction protocols by combining simpler, and eventually primitive, protocols. Reo [4,7,8,15] serves as a premier example of such an interaction-based model of concurrency. In this paper, we describe Reo and its compiler. We show how exogenous coordination in Reo reflects an interaction-centric model of concurrency where an interaction (protocol) consists of nothing but a relational constraint on communication actions. In this setting, interaction protocols become explicit, concrete, tangible (software) constructs that can be specified, verified, composed, and reused, independently of the actors that they may engage in disparate applications.

show abstract

Channel-based coordination via constraint satisfaction

Cited by 25 publications

References 20 publications

Partial Connector Colouring

Partial Connector Colouring

Service Orchestration with Priority Constraints

Coordinating Multicore Computing

Contact Info

Product

Resources

About