Checking Equivalence for Reo Networks

Electronic Notes in Theoretical Computer Science

Volumn 215, Issue C, 2008, Pages 209-226

  Blechmann, Tobias ^a   Baier, Christel ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

bisimulation; coordination; partitioning splitter; Reo; symbolic model checking

Indexed keywords

DATA STRUCTURES; EQUIVALENCE CLASSES; FILE ORGANIZATION; MODEL CHECKING; ROBOTS; TRANSLATION (LANGUAGES);

(U ,V) OPERATOR; BISIMULATION EQUIVALENCES; COMPOSITIONAL APPROACH; CONSTRAINT AUTOMATON; COORDINATION LANGUAGES; EFFICIENT TREATMENT; ELSEVIER (CO); IN ORDER; LABELED TRANSITIONS; OPERATIONAL MODELING; PAPER ADDRESSES; SYMBOLIC DATA; SYMBOLIC REPRESENTATIONS;

AUTOMATA THEORY;

EID: 46049102575     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.06.029     Document Type: Article

References (15)

1. Arbab F. Reo: A Channel-based Coordination Model for Component Composition. Mathematical Structures in Computer Science 14 3 (2004) 1-38
2. Baier C., Sirjani M., Arbab F., and Rutten J.J.M.M. Modeling Component Connectors in Reo by Constraint Automata. Science of Computer Programming 61 (2006) 75-113
3. CAPD: Construction and Analysis of Distributed Processes. http://www.inrialpes.fr/vasy/cadp/
4. CWB: The Edinburgh Concurrency Workbench. http://homepages.inf.ed.ac.uk/perdita/cwb/
5. Arbab F. Abstract Behavior Types: A Foundation Model for Components and Their Composition. Lecture Notes in Computer Science 2852 (2003) 33-70
6. Bryant R. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35 (1986)
7. McMillan K. Symbolic Model Checking (1993), Kluwer Academic Publishers
8. Kannelakis P., and Smolka S. Finite State Processes and three Problems of Equivalence. CCS expressions (1983) 228-240 Proc. 2nd ACM Symposium on the Principles of Distributed Computing 1983
9. Minato S., Ishiura N., and Yajima S. Shared binary decision diagrams with attributed edges for efficient Boolean function manipulation. Proceedings of the 27th ACM/IEEE Design Automation Conference (1990), ACM, New York 52-57
10. Meinel C., and Theobald T. Algorithms and Data Structures in VLSI Design (1998), Springer-Verlag
11. Wegener I. Branching Programs and Binary Decision Diagrams. Theory and Applications. Monographs on Discrete Mathematics and Applications (2000), SIAM
12. Parosh Aziz Abdulla, Lisa Kaati, Marcus Nilsson, Minimization of Non-Deterministic Automata with Large Alphabets, Proc. CIAA'05, 2005
13. Bouali A., and de Simone R. Symbolic Bisimulation Minimisation. Computer Aided Verification (1992) 96-108
14. S. Klüppelholz and C. Baier, Symbolic Model Checking for Channel-based Component Connectors, FOCLASA 2006
15. Ossowski J. JINC, a bdd library. http://www.jossowski.de