Modeling component connectors in Reo by constraint automata
- 31 July 2006
- journal article
- Published by Elsevier BV in Science of Computer Programming
- Vol. 61 (2), 75-113
- https://doi.org/10.1016/j.scico.2005.10.008
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Reo: a channel-based coordination model for component compositionMathematical Structures in Computer Science, 2004
- Composing architectural styles from architectural primitivesACM SIGSOFT Software Engineering Notes, 2003
- Simulation-based minimizationACM Transactions on Computational Logic, 2003
- A Coinductive Calculus of Component ConnectorsLecture Notes in Computer Science, 2003
- Computing simulations on finite and infinite graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simulation RevisitedLecture Notes in Computer Science, 2001
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Automata on Infinite ObjectsPublished by Elsevier BV ,1990
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984