An Alternative Algorithm for Constraint Automata Product

  • Bahman Pourvatan
  • Nima Rouhy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4767)


Reo is a language for exogenous coordination of component connectors based on a calculus of channels. Constraint automata has been proposed as Reo formal semantics. The corresponding constraint automata of a Reo circuit is compositionally constructed by the product of all the constituent constraint automata. We introduce a simple alternative algorithm for computing product of two constraint automata in this paper. We also give a greedy algorithm for finding the order of selection of two constraint automata when we have to compute product of more than two constraint automata. The order of our algorithm is less than the other algorithms proposed earlier by a constant factor. We propose an algebraic representation for constraint automata which our product algorithm is based on. Input and output of the provided tool are consistent with the other tools supporting Reo join and constraint automata product.


Reo Constraint Automata Constraint Automata Product 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arbab, F.: Abstract behavior types: A foundation model for components and their composition. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2002. LNCS, vol. 2852, pp. 33–70. Springer, Heidelberg (2003)Google Scholar
  2. 2.
    Arbab, F.: Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science 14, 329–366 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Arbab, F., Baier, C., Rutten, J.J., Sirjani, M.: Modeling component connectors in Reo by constraint automata (extended abstract). In: FOCLASA 2003. Proceedings of Second International Workshop on Foundations of Coordination Languages and Software Architectures. ENTCS, vol. 97, pp. 25–46. Elsevier, Amsterdam (2004)Google Scholar
  4. 4.
    Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.: Modeling component connectors in reo by constraint automata. Science of Computer Programming 61, 75–113 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Mehta, N., Medvidovic, N., Sirjani, M., Arbab, F.: Modeling behavior in compositions of software architectural. In: ASE 2004, pp. 371–374 (2004)Google Scholar
  6. 6.
    Ghassemi, F., Tasharofi, S., Sirjani, M.: Automated mapping of reo circuits to constraint automata. In: FSEN 2005. Proceedings of the First International Conference on Fundamentals of Software Engineering. ENTCS, vol. 159, pp. 99–115. Elsevier, Amsterdam (2006)Google Scholar
  7. 7.
    Salomaa, A.: Computation and Automata. In: Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge (1985)Google Scholar
  8. 8.
    Hopcraft, J., Ulman, J.: Introduction to Automata Theory, Language and Computation. Addison-Wesley, Reading (1979)Google Scholar
  9. 9.
    Harison, M.: Introduction to Formal Language Theory. Addison-Wesley, Reading (1978)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Bahman Pourvatan
    • 1
  • Nima Rouhy
    • 1
  1. 1.AmirKabir University of Technology, TehranIran

Personalised recommendations