Automated Mapping of Reo Circuits to Constraint Automata

Authors:
Fatemeh Ghassemi;Samira Tasharofi;Marjan Sirjani
Affiliations:
Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran and School of Computer Science, IPM, Tehran, Iran
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 6
Cited 2

Evaluation of Software Architecture for a Control System: A Case Study

COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Coordination through Channel Composition

COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Reo: a channel-based coordination model for component composition

Mathematical Structures in Computer Science
Modeling Behavior in Compositions of Software Architectural Primitives

Proceedings of the 19th IEEE international conference on Automated software engineering
Models and Temporal Logics for Timed Component Connectors

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Formal Semantics and Analysis of Component Connectors in Reo

Electronic Notes in Theoretical Computer Science (ENTCS)

An alternative algorithm for constraint automata product

FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Generating test cases for constraint automata by genetic symbiosis algorithm

ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A tool is developed in order to input Reo circuits and generate their corresponding constraint automata. The XML schemas for input and output are presented which establish a common interface for generating an integrated set of tools. Two heuristics in joining constraint automata are presented and experimental results are shown.