Synthesis of Reo circuits for implementation of component-connector automata specifications

Lecture Notes in Computer Science

Volumn 3454, Issue , 2005, Pages 236-251

  Arbab, Farhad ^a,c   Baier, Christel ^b   De Boer, Frank ^a,c   Rutten, Jan ^a,d   Sirjani, Marjan ^e  

^a CWI   (Netherlands)

^b UNIVERSITY OF BONN   (Germany)

^c LEIDEN UNIVERSITY   (Netherlands)

^d VU UNIVERSITY AMSTERDAM   (Netherlands)

^e SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; CONCURRENCY CONTROL; MIDDLEWARE;

CONSTRAINT AUTOMATON; GLUE-CODE LANGUAGE; REO CODES; RUN-TIME MIDDLEWARE;

FINITE AUTOMATA;

EID: 24644453210     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11417019_16     Document Type: Conference Paper

References (20)

1. F. Arbab. Abstract behavior types: A foundation model for components and their composition. In [11], pages 33-70, 2003.
2. F. Arbab. Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science, 14(3):1-38, 2004.
3. F. Arbab, C. Baier, F. de Boer, and J. Rutten. Models and temporal logics for timed component connectors. In Proc. SEFM'04. IEEE CS Press, 2004.
4. F. Arbab, C. Baier, J.J.M.M. Rutten, and M. Sirjani. Modeling component connectors in reo by constraint automata. In FOCLASA'03, volume 97 of ENTCS, pages 25-41, 2004. Full version see http://web.informatik.uni-bonn.de/I/baier/ publikationen.html.
5. F. Arbab and J.J.M.M. Rutten. A coinductive calculus of component connectors. In Recent Trends in Algebraic Development Techniques, Proc. 16th Int. Workshop on Algebraic Development Techniques (WADT 2002), volume 2755 of LNCS, pages 35-56, 2003.
6. P.C. Attie and E.A. Emerson. Synthesis of concurrent systems with many similar sequential processes. In Proc. POPL, ACM Press, pages 191-201, 1989.
7. M. Broy and K. Stolen. Specification and Development of Interactive Systems: Focus on Streams, Interfaces and Refinement. Springer-Verlag, 2000.
8. A. Church. Logic, arithmetic and automata. In Proc. Int. Congress of Mathematicians, pages 23-35. Institut Mittag-Leffler, 1962.
9. CIM. http://www.almende.com/cim/.
10. D. Clarke, D. Costa, and F. Arbab. Modeling coordination in biological systems. In Proc. of the Int. Symposium on Leveraging Applications of Formal Methods (ISoLA 2004), 2004.
11. N. Diakov and F. Arbab. Compositional construction of web services using Reo. In Proc. International Workshop on Web Services: Modeling, Architecture and Infrastructure (ICEIS 2004), Porto, Portugal, April 13-14, 2004.
12. E.A. Emerson and E.M. Clarke. Using branching time logic to synthesize synchronous skeleton. Science of Programming, 2:241-266, 1982.
13. T. Henzinger, R. Jhala, and R. Majumdar. Counterexample-guided control. In Proc. 30th Int. Colloquium on Automata, Languages, and Programming (ICALP), volume 2719 of LNCS, pages 886-902, 2003.
14. J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, 2nd edition edition, 2001.
15. Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6:68-93, 1984.
16. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th Symposium on Principles of Programming Languages, pages 179-190. ACM Press, 1989.
17. J.J.M.M. Rutten. Component connectors. In [?], chapter 5, pages 73-87. 2004.
18. W. Thomas. On the synthesis of strategies in infinite games. In Proc. of the 12th Annual Symp. on Theoretical Aspects of Computer Science, volume 900 of LNCS, pages 1-13, 1995.
19. M. Vardi. An automata-theoretic approach to fair realizability and synthesis. In Proc. CAV, volume 939 of LNCS, pages 267-278, 1995.
20. Z. Zlatev, N. Diakov, and S. Pokraev. Construction of negotiation protocols for E-Commerce applications. ACM SIGecom Exchanges, 5(2):11-22, November 2004.