Design and Verification of Systems with Exogenous Coordination Using Vereofy

Baier, Christel; Blechmann, Tobias; Klein, Joachim; Klüppelholz, Sascha; Leister, Wolfgang

doi:10.1007/978-3-642-16561-0_15

Cited by 28 publications

(33 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Related work There has been work on specification, verification and model checking of Reo circuits [5,15,16,3]. The work presented in [5,16] have a strong connection with our work in the sense that the languages presented stem from process algebra.…”

Section: Discussionmentioning

confidence: 90%

“…A full comparison, discussing the (dis)advantages of each approach, between the approach of [16] and what we present in this paper is left as future work. The main difference with the work presented in [15,3] is that they consider Büchi like automata (and thus, infinite traces). Also, in [3], only connectors which are not context dependent are taken into account (since they base their results on the constraint automata model).…”

Section: Discussionmentioning

confidence: 99%

“…The main difference with the work presented in [15,3] is that they consider Büchi like automata (and thus, infinite traces). Also, in [3], only connectors which are not context dependent are taken into account (since they base their results on the constraint automata model).…”

Section: Discussionmentioning

confidence: 99%

See 2 more Smart Citations

A Specification Language for Reo Connectors

Silva

2012

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. Reo is a model of component coordination, wherein complex connectors are constructed by composing various types of primitive channels. Reo automata are a simple and intuitive formal model of context-dependent connectors, which provided a compositional semantics for Reo. In this paper, we study Reo automata from a coalgebraic perspective. This enables us to apply the recently developed coalgebraic theory of generalized regular expressions in order to derive a specification language, tailor-made for Reo automata, and sound and complete axiomatizations with respect to three distinct notions of equivalence: (coalgebraic) bisimilarity, the bisimulation notion studied in the original papers on Reo automata and trace equivalence. The obtained language is simple, but nonetheless expressive enough to specify all possible finite Reo automata. Moreover, it comes equipped with a Kleene-like theorem: we provide algorithms to translate expressions to Reo automata and, conversely, to compute an expression equivalent to a state in a Reo automaton.

show abstract

Section: Discussionmentioning

confidence: 90%

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A Specification Language for Reo Connectors

Silva

2012

Fundamentals of Software Engineering

View full text Add to dashboard Cite

show abstract

“…The Red producer code (lines [23][24][25][26][27][28][29][30][31]) is analogous to that of the Green producer, with "red" and "green" swapped. This is a simple concurrent application whose code has been made even simpler by abstracting away its computation and declarations.…”

Section: Fig 1 Alternating Producers and Consumermentioning

confidence: 99%

“…Several model checking tools are available for analyzing Reo. The Vereofy model checker, integrated in ECT, is based on constraint automata [5,[21][22][23][24]28,37,55,56]. Properties of Reo connectors can be specified for verification by Vereofy in a language based on Linear Temporal Logic (LTL), or on a variant of Computation Tree Logic (CTL), called Alternating-time Stream Logic (ASL).…”

Section: Overview Of Reomentioning

confidence: 99%

Coordinating Multicore Computing

Arbab

Jongmans

2015

Lecture Notes in Computer Science

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