Synthesis of Reo Circuits for Implementation of Component-Connector Automata Specifications

  • Farhad Arbab
  • Christel Baier
  • Frank de Boer
  • Jan Rutten
  • Marjan Sirjani
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3454)

Abstract

Composition of a concurrent system out of components involves coordination of their mutual interactions. In component-based construction, this coordination becomes the responsibility of the glue-code language and its underlying run-time middle-ware. Reo offers an expressive glue-language for construction of coordinating component connectors out of primitive channels. In this paper we consider the problem of synthesizing Reo coordination code from a specification of a behavior as a relation on scheduled-data streams. The specification is given as a constraint automaton that describes the desired input/output behavior at the ports of the components. The main contribution in this paper is an algorithm that generates Reo code from a given constraint automaton.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arbab, F.: Abstract behavior types: A foundation model for components and their composition. In: [11], pp. 33–70 (2003)Google Scholar
  2. 2.
    Arbab, F.: Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science 14(3), 1–38 (2004)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Arbab, F., Baier, C., de Boer, F., Rutten, J.: Models and temporal logics for timed component connectors. In: Proc. SEF 2004.IEEE CS Press, Los Alamitos (2004)Google Scholar
  4. 4.
    Arbab, F., Baier, C., Rutten, J.J.M.M., Sirjani, M.: Modeling component connectors in reo by constraint automata. In: FOCLASA’03, volume 97 of ENTCS, pp. 25–41 (2004) Full version see, http://web.informatik.uni-bonn.de/I/baier/publikationen.html.
  5. 5.
    Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 35–56. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Attie, P.C., Emerson, E.A.: Synthesis of concurrent systems with many similar sequential processes. In: Proc. POPL, pp. 191–201. ACM Press, New York (1989)Google Scholar
  7. 7.
    Broy, M., Stolen, K.: Specification and Development of Interactive Systems: Focus on Streams, Interfaces and Refinement. Springer, Heidelberg (2000)MATHGoogle Scholar
  8. 8.
    Church, A.: Logic, arithmetic and automata. In: Proc. Int. Congress of Mathematicians, pp. 23–35. Institut Mittag-Leffler (1962)Google Scholar
  9. 9.
  10. 10.
    Clarke, D., Costa, D., Arbab, F.: Modeling coordination in biological systems. In: Margaria, T., Steffen, B. (eds.) ISoLA 2004. LNCS, vol. 4313, pp. 9–25. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  11. 11.
    Diakov, N., Arbab, F.: 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)Google Scholar
  12. 12.
    Emerson, E.A., Clarke, E.M.: Using branching time logic to synthesize synchronous skeleton. Science of Programming 2, 241–266 (1982)CrossRefMATHGoogle Scholar
  13. 13.
    Henzinger, T., Jhala, R., Majumdar, R.: Counterexample-guided control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 886–902. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Language, and Computation, 2nd edn. Addison–Wesley, London (2001)MATHGoogle Scholar
  15. 15.
    Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic speci-fications. ACM Transactions on Programming Languages and Systems 6, 68–93 (1984)CrossRefMATHGoogle Scholar
  16. 16.
    Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th Symposium on Principles of Programming Languages, pp. 179–190. ACM Press, New York (1989)Google Scholar
  17. 17.
    Rutten, J.J.M.M.: Component connectors. In: chapter 5, pp. 73–87 (2004)Google Scholar
  18. 18.
    Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  19. 19.
    Vardi, M.: An automata-theoretic approach to fair realizability and synthesis. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 267–278. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  20. 20.
    Zlatev, Z., Diakov, N., Pokraev, S.: Construction of negotiation protocols for E-Commerce applications. ACM SIGecom Exchanges 5(2), 11–22 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Farhad Arbab
    • 1
    • 3
  • Christel Baier
    • 2
  • Frank de Boer
    • 1
    • 3
  • Jan Rutten
    • 1
    • 4
  • Marjan Sirjani
    • 5
  1. 1.CWIAmsterdamThe Netherlands
  2. 2.Institut für Informatik IUniversität BonnGermany
  3. 3.Universiteit LeidenThe Netherlands
  4. 4.Vrije UniversiteitAmsterdamThe Netherlands
  5. 5.Sharif University of TechnologyTehranIran

Personalised recommendations