[HTML][HTML] Constraint automata with memory cells and their composition
Over the past decades, coordination languages emerged for modeling and implementing
concurrency protocols among components in component-based systems. Coordination …
concurrency protocols among components in component-based systems. Coordination …
A basic logic for reasoning about connector reconfiguration
D Clarke - Fundamenta Informaticae, 2008 - content.iospress.com
Software systems evolve over time. From a component-based software engineering
perspective, this means that either the components of the system need to change, or, if …
perspective, this means that either the components of the system need to change, or, if …
A reo model of software defined networks
H Feng, F Arbab, M Bonsangue - … 2019, Shenzhen, China, November 5–9 …, 2019 - Springer
Reo is a compositional coordination language for component connectors with a formal
semantics based on automata. In this paper, we propose a formal model of software defined …
semantics based on automata. In this paper, we propose a formal model of software defined …
Using Reo for formal specification and verification of system designs
N Razavi, M Sirjani - … on Formal Methods and Models for Co …, 2006 - ieeexplore.ieee.org
In this paper, we introduce a component-based approach to specify and verify system-level
designs. A coordination language, Reo, is used to support hierarchical design and …
designs. A coordination language, Reo, is used to support hierarchical design and …
[PDF][PDF] Genetic symbiosis algorithm generating test data for constraint automata
A Rezaee - Applied and Computational Mathematics, 2008 - academia.edu
Constraint automata are a semantic model for XML modeling language. Testing correctness
of mapping black-box components in XML to constraint automata is an important problem in …
of mapping black-box components in XML to constraint automata is an important problem in …
Composing constraint automata, state-by-state
The grand composition of n automata may have a number of states/transitions exponential in
n. When it does, it seems not unreasonable for the computation of that grand composition to …
n. When it does, it seems not unreasonable for the computation of that grand composition to …
An alternative algorithm for constraint automata product
B Pourvatan, N Rouhy - … Symposium, FSEN 2007, Tehran, Iran, April 17-19 …, 2007 - Springer
Reo is a language for exogenous coordination of component connectors based on a
calculus of channels. Constraint automata has been proposed as Reo formal semantics. The …
calculus of channels. Constraint automata has been proposed as Reo formal semantics. The …
[PDF][PDF] Composing constraint automata, state-by-state (Technical report)
The grand composition of n automata may have a number of states/transitions exponential in
n. When it does, it seems not unreasonable for the computation of that grand composition to …
n. When it does, it seems not unreasonable for the computation of that grand composition to …
Generating test cases for constraint automata by genetic symbiosis algorithm
S Tasharofi, S Ansari, M Sirjani - … ICFEM 2006, Macao, China, November 1 …, 2006 - Springer
Constraint automata are a semantic model for Reo modeling language. Testing correctness
of mapping black-box components in Reo to constraint automata is an important problem in …
of mapping black-box components in Reo to constraint automata is an important problem in …
[PDF][PDF] A basic logic for reasoning about connector reconfiguration
D Clarke - Fundamenta informaticae, 2008 - lirias.kuleuven.be
Software systems evolve over time. From a component-based software engineering
perspective, this means that either the components of the system need to change, or, if …
perspective, this means that either the components of the system need to change, or, if …