Filters








35 Hits in 2.6 sec

Automated Mapping of Reo Circuits to Constraint Automata

Fatemeh Ghassemi, Samira Tasharofi, Marjan Sirjani
2006 Electronical Notes in Theoretical Computer Science  
A tool is developed in order to input Reo circuits and generate their corresponding constraint automata.  ...  Two heuristics in joining constraint automata are presented and experimental results are shown.  ...  Acknowledgement We are grateful to Mohammad Taghi Hajiaghayi for his useful comments on analyzing the algorithms discussed in this paper.  ... 
doi:10.1016/j.entcs.2005.12.064 fatcat:24d6g7ty2bay3gpxeful46me2u

Reo + mCRL2 : A framework for model-checking dataflow in service compositions

Natallia Kokash, Christian Krause, Erik de Vink
2011 Formal Aspects of Computing  
We unify our previous work on mapping various semantic models for Reo, namely, constraint automata, timed constraint automata, coloring semantics and the newly developed action constraint automata, to  ...  To ensure that the composed system behaves as intended, we need a wide range of automated verification tools to assist service composition designers.  ...  These tools include algorithms to compute constraint automata and coloring tables used to model check and animate the execution of graphical Reo circuits [AKM + 08].  ... 
doi:10.1007/s00165-011-0191-6 fatcat:tzflijtbb5gcdlpdoeurh42z6y

From Timed Reo Networks to Networks of Timed Automata

Natallia Kokash, Mohammad Mahdi Jaghoori, Farhad Arbab
2013 Electronical Notes in Theoretical Computer Science  
In this paper, we present a mapping of timed Reo networks to networks of timed automata used for system specification in Uppaal.  ...  However, the development of verification tools for Reo-specific semantic models, namely, constraint automata with its multiple extensions to represent quality of service, time constraints, context-dependent  ...  Here we present a mapping of Reo networks to the Uppaal networks of timed automata.  ... 
doi:10.1016/j.entcs.2013.04.004 fatcat:zk4w4uszhrfh3d5qeficla6khy

Compositional Semantics of an Actor-Based Language Using Constraint Automata [chapter]

Marjan Sirjani, Mohammad Mahdi Jaghoori, Christel Baier, Farhad Arbab
2006 Lecture Notes in Computer Science  
To this end, we consider reactive objects in Rebeca as components in Reo, and specify their behavior using constraint automata as black-box components within Reo circuits.  ...  Modeling coordination and communication among reactive objects as Reo circuits, and the behavior of reactive objects as constraint automata, provides a compositional semantics for Rebeca.  ...  We have already developed a tool to automate the specified mapping [23] , and we have used it to map a few case studies in Rebeca into constraint automata.  ... 
doi:10.1007/11767954_18 fatcat:bmfochvjrbduraadvilhxe42qi

Input-output Conformance Testing for Channel-based Service Connectors

Natallia Kokash, Farhad Arbab, Behnaz Changizi, Leonid Makhnist
2011 Electronic Proceedings in Theoretical Computer Science  
Our approach is based on the input-output conformance (ioco) testing theory and exploits the mapping of automata-based semantic models for Reo to equivalent process algebra specifications.  ...  One of the challenges of modern software engineering is to ensure that such a system behaves as intended by its designer.  ...  As follows from our mapping of constraint-automata-based semantics of Reo to LTS, each set of transition labels {A, B,C} in a CA corresponds to a transition with a unique action label A|B|C in the corresponding  ... 
doi:10.4204/eptcs.60.2 fatcat:pb4bwar6djcfrotc3v3nnqa6mm

Automated Analysis of Reo Circuits using Symbolic Execution

Bahman Pourvatan, Marjan Sirjani, Hossein Hojjat, Farhad Arbab
2009 Electronical Notes in Theoretical Computer Science  
We propose a technique for symbolic execution of Reo circuits using Constraint Automata and more specifically exploiting their data constraints.  ...  We illustrate the technique on a set of data dominated circuits as well as a non-trivial critical section problem. A tool is implemented to automate the proposed technique.  ...  For symbolic execution of Reo circuits we use Constraint Automata, which allows us to use known algorithms and techniques in the domain of automata theory.  ... 
doi:10.1016/j.entcs.2009.10.029 fatcat:hplrvzjmbzdu3jshlxdec7pfvy

Compositional Workflow Modeling with Priority Constraints

Behnaz Changizi, Natallia Kokash, Farhad Arbab, Leonid Makhnist
2020 Science of Computer Programming  
to influence the work reported in this paper.  ...  CRediT authorship contribution statement Declaration of competing interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared  ...  The presented formalism is compatible with other extensions of Reo which rely on constraint solving to build the semantic model of the circuit [49] .  ... 
doi:10.1016/j.scico.2020.102578 fatcat:6ptheuwqwzgwxlrmaddqfh2pqe

Formal Modeling and Conformance Validation for WS-CDL using Reo and CASM

Samira Tasharofi, Marjan Sirjani
2009 Electronical Notes in Theoretical Computer Science  
In this paper, we benefit from Reo and Constraint Automata with State Memory (CASM) to address this problem by providing a unified formalism for choreography and orchestration.  ...  The main use of a choreography description is to precisely define the sequence of interactions between a set of cooperating web services in order to promote a common understanding between participants  ...  In [28] we proposed a mapping from BPEL to Reo and CA (simple form of CASM).  ... 
doi:10.1016/j.entcs.2009.06.034 fatcat:roijdmfrerhepgwf6lqi37gn7a

Puff, The Magic Protocol [chapter]

Farhad Arbab
2011 Lecture Notes in Computer Science  
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.  ...  Traditional models of concurrency resort to peculiarly indirect means to express interaction and study its properties.  ...  Translation of Reo circuits and constraint automata into RSL and CARML is automatic, and the counter-examples found by Vereofy can automatically be mapped back into the ECT and displayed as Reo circuit  ... 
doi:10.1007/978-3-642-24933-4_9 fatcat:ldjkohyyovgqriatenmd4ha634

Formal Design and Verification of Long-Running Transactions with Extensible Coordination Tools

Natallia Kokash, Farhad Arbab
2013 IEEE Transactions on Services Computing  
The operational semantics of Reo is given by constraint automata (CA).  ...  to complete due to another reason.  ...  The operational semantics of time-aware Reo circuits is given by timed constraint automata (TCA) [26] , which are defined as follows: Let C be a finite set of clocks.  ... 
doi:10.1109/tsc.2011.46 fatcat:v5uwfpb2ajajvfciyxtojdry6m

Synthesis of Reo Circuits from Scenario-based Specifications

Farhad Arbab, Meng Sun, Christel Baier
2009 Electronical Notes in Theoretical Computer Science  
In this paper we propose a novel synthesis technique, which can be used to generate Reo circuits directly from scenario specifications.  ...  Typically, the behavior of such an application emerges from the interaction and collaboration of multiple components/services.  ...  Acknowledgement The authors are indebted to the members of SEN3 for helpful discussions.  ... 
doi:10.1016/j.entcs.2009.06.027 fatcat:7vtmnfuosvdgtb3mihrc7zcd5e

Relating BIP and Reo

Kasper Dokter, Sung-Shik Jongmans, Farhad Arbab, Simon Bliudze
2015 Electronic Proceedings in Theoretical Computer Science  
Moreover, this basis offers translations that enable users of either language to benefit from the toolchains of the other.  ...  Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly.  ...  We define a mapping reo 1 that transforms BIP architectures into port automata, and a mapping bip 1 that transforms port automata into BIP architectures.  ... 
doi:10.4204/eptcs.189.3 fatcat:6nekohwkyvav5ajgpib5tn4jc4

Automated Verification = Graphs, Automata, and Logic [chapter]

Moshe Y. Vardi
2000 Lecture Notes in Computer Science  
Lastly, we implement a toolchain that compiles our automata to Maude, allowing us to apply the rich model checking capability of Maude to verify agent behavior.  ...  We then show how this logic can be used to diagnose undesired behavior by tracing the falsification of a specification back to one or more culpable components.  ...  Acknowledgements The authors would like to thank Vivek Nigam and the anonymous referees for their valuable feedback.  ... 
doi:10.1007/3-540-44622-2_8 fatcat:77aurtsjlrdg3mnyr2nmwxugaq

Soft component automata: Composition, compilation, logic, and verification

Tobias Kappé, Benjamin Lion, Farhad Arbab, Carolyn Talcott
2019 Science of Computer Programming  
Lastly, we implement a toolchain that compiles our automata to Maude, allowing us to apply the rich model checking capability of Maude to verify agent behavior.  ...  We then show how this logic can be used to diagnose undesired behavior by tracing the falsification of a specification back to one or more culpable components.  ...  Acknowledgements The authors would like to thank Vivek Nigam and the anonymous referees for their valuable feedback.  ... 
doi:10.1016/j.scico.2019.08.001 fatcat:w7yk633v2veovivyjsfpp6jeum

Model Checking of Component Connectors

Mohammad Izadi, Ali Movaghar, Farhad Arbab
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
For more examples and details of Reo circuits see [13, 14, 19, 30] . Basic Theory of Constraint Automata Constraint automata were introduced as the semantics of Reo first in [30] .  ...  In the joint works of Kokash, Krause et al., reported in [91, 92, 93, 94] , and [95] , they map some semantic models for Reo, namely, constraint automata, timed constraint automata, and coloring semantics  ... 
doi:10.1109/compsac.2007.153 dblp:conf/compsac/IzadiMA07 fatcat:lysriwrovfalxdsge5jm7xxuvi
« Previous Showing results 1 — 15 out of 35 results