Modeling component connectors in Reo by constraint automata

@article{Baier2006ModelingCC,
  title={Modeling component connectors in Reo by constraint automata},
  author={C. Baier and M. Sirjani and F. Arbab and J. Rutten},
  journal={Sci. Comput. Program.},
  year={2006},
  volume={61},
  pages={75-113}
}
In this paper we introduce constraint automata and propose them as an operational model for Reo, an exogenous coordination language for compositional construction of component connectors based on a calculus of channels. By providing composition operators for constraint automata and defining notions of equivalence and refinement relations for them, this paper covers the foundations for building tools to address concerns such as the automated construction of the automaton for a given component… Expand
Model Checking of Component Connectors
TLDR
The main goal of this work is to prepare a model checking based verification environment for component-based systems, whose component connectors are modeled by Reo networks and constraint automata. Expand
Automata Based Model Checking for Reo Connectors
TLDR
This paper gives an efficient on-the-fly algorithm for the model checking of formulas for Reo connectors by generalizing standard automata based model checking algorithms for linear time temporal logic. Expand
Formal Verification for Components and Connectors
TLDR
The paper presents the syntax and semantics of the logics, sketches the model checking algorithms, summarizes the main features of the implementation within the tool Vereofy and reports on experimental studies. Expand
Checking Equivalence for Reo Networks
TLDR
This paper presents a compositional approach for the generation of a symbolic representation of constraint automata for Reo networks and reports on an implementation that realizes a partitioning splitter technique for checking bisimulation equivalence for ReO networks. Expand
Decomposing port automata
TLDR
It is presented that all (finite) port automata can be generated from a small set of primitive port Automata, and applied to component connectors means that all component connectors can be constructed from just two primitive connectors. Expand
Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications
TLDR
The main contribution in this paper is an algorithm that generates Reo code from a given constraint automaton that describes the desired input/output behavior at the ports of the components. Expand
Modeling and Verification of Components and Connectors
TLDR
This paper presents an overview of the modeling concepts for components and connectors using Reo and the underlying constraint automata framework and detail the specification and verification of properties using logics tailored to this framework. Expand
Compositional Failure-based Equivalence of Constraint Automata
TLDR
This paper shows that failure-based equivalences CFFD and NDFD are congruences with respect to composition of constraint automata using their join (production) and hiding operators and can be used for reducing sizes of models before doing model checking based verification. Expand
Intentional Automata: A Context-Dependent Model for Component Connectors - (Extended Abstract)
In recent years, a promising line of research on formal compositional models for component connectors [3-6, 8, 9] has demonstrated the merits of having connectors as first class concepts, andExpand
Symbolic Model Checking for Channel-based Component Connectors
TLDR
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo, which relies on variants of standard automata-based approaches and model checking for CTL-like logics. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 44 REFERENCES
A Coinductive Calculus of Component Connectors
TLDR
A simple and transparent semantical model for Reo, in which connectors are relations on timed data streams, and coinduction is the main reasoning principle and it is used to prove properties such as connector equivalence. Expand
Interface automata
TLDR
This work presents a light-weight formalism that captures the temporal aspects of software component interfaces through an automata-based language that supports automatic compatability checks between interface models, and thus constitutes a type system for component interaction. Expand
Reo: a channel-based coordination model for component composition
  • F. Arbab
  • Computer Science
  • Mathematical Structures in Computer Science
  • 2004
TLDR
It is shown that exogenous coordination patterns that can be expressed as (meta-level) regular expressions over I/O operations can be composed in Reo out of a small set of only five primitive channel types. Expand
Effective modeling of software architectural assemblies using constraint automata
TLDR
This work proposes a formal approach to effectively model software architectural assemblies that addresses limitations, using constraint automata, and evaluates the effectiveness of this approach using two application architectures assembled from Alfa's primitives. Expand
A simple process algebra based on atomic actions with resources
  • P. Gastin, M. Mislove
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 2004
TLDR
A congruence theorem is proved relating the two semantics, which implies the operational model itself is compositional, and implies the denotational model is adequate with respect to the operational semantics. Expand
An introduction to input/output automata
TLDR
This paper is intended to introduce researchers to the input output automaton model and examines several illustrative examples concerning candy vending machines and other uses of the model. Expand
Introduction to Process Algebra
  • W. Fokkink
  • Mathematics, Computer Science
  • Texts in Theoretical Computer Science. An EATCS Series
  • 2000
TLDR
This textbook gives a thorough introduction into the basics of process algebra and its applications. Expand
Computing simulations on finite and infinite graphs
TLDR
2D rectangular automata, which model discrete reactive systems with continuous environments, define effectively presented infinite graphs with finite similarity relations and it follows that the refinement problem and the /spl forall/CTL* model-checking problem are decidable for 2D rectangular Automata. Expand
CCS expressions, finite state processes, and three problems of equivalence
TLDR
It is shown that observation equivalence can be tested in cubic time and is the limit of a sequence of equivalence notions, and that, even for a very restricted type of process, testing for failure equivalence is PSPACE-complete. Expand
A Calculus of Communicating Systems
  • R. Milner
  • Mathematics, Computer Science
  • Lecture Notes in Computer Science
  • 1980
TLDR
A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0. Expand
...
1
2
3
4
5
...