Abstract
Reo is an exogenous coordination language for component connectors extending data flow networks with synchronization and context-dependent behavior. The first proposed formalism to capture the operational semantics of Reo is called constraint automaton. In this paper, we propose another operational model of Reo based on Büchi automata in which port synchronization is modeled by records labeling the transitions, whereas context dependencies are stored in the states. It is shown that constraint automata can be recast into our proposed Büchi automata of records. Also, we provide a composition operator which models the joining of two connectors and show that it can be obtained by using two standard operators: alphabet extension and automata product. Our semantics has the advantage over previous models in that it is based on standard automata theory, so that existing theories and tools can be easily reused. Moreover, it is the first formal model addressing all of Reo’s features: synchronization, mutual exclusion, hiding, and context-dependency.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Arbab F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329–366 (2004)
Arbab, F., Baier, C., de Boer, F., Rutten, J., Sirjani, M.: Synthesis of Reo circuites for implementation of component-connector automata specifications. In: Proceedings of Coordination Languages and Models (CORDINATION 2005), LNCS, vol. 3454, pp. 236–251. Springer-Verlag (2005)
Arbab, F., Chothia, T., Meng, S., Moon, Y.-J.: Component connectors with QoS guarantees. In: Proceedings of Coordination Languages and Models (CORDINATION 2007), LNCS, vol. 4467, pp. 286–304. Springer-Verlag (2007)
Arbab, F., Rutten, J.: A coinductive calculus of component connectors. In: Proceedings of Recent Trends in Algebraic Development Techniques, (WADT 2002) LNCS, vol. 2755, pp. 34–55. Springer-Verlag (2002)
Arbab, F., Baier, C., de Boer, F., Rutten, J.: Models and temporal logics for timed component connectors. In: Proceedings of the IEEE International Conference on Software Engineering and Formal Methods (SEFM), pp. 198–207. IEEE Computer Society (2004)
Baier C., Sirjani M., Arbab F., Rutten J.: Modelling component connectors in Reo by constraint automata. Sci. Comput. Program. 61, 75–113 (2006)
Baier, C., Wolf, V.: Stochastic reasoning about channel-based component connectors. In: Proceedings of Coordination Languages and Models (CORDINATION 2006), LNCS, vol. 4037, pp. 1–15. Springer-Verlag (2006)
Bliudze S., Sifakis J.: The algebra of connectors—structuring interaction in BIP. IEEE Trans. Comput. 57(10), 1315–1330 (2008)
Bonsangue, M., Clarke, D., Silva, A.: Automata for context-dependent connectors. In: Proceedings of Coordination Languages and Models (CORDINATION 2009), LNCS, vol. 5521, pp. 184–203. Springer-Verlag (2009)
Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: an open source tool for symbolic model checking. In: Proceedings of the 14th CAV, LNCS, vol. 2404, pp. 359–364. Springer-Verlag (2002)
Clarke E., Grumberg O., Peled D.: Model Checking. The MIT Press, Cambridge (1999)
Clarke, D.: Coordination: Reo, nets, and logic. In: Proceedings of Formal Methods on Components and Objects (FMCO 2008), LNCS, vol. 5382, pp. 226–256. Springer-Verlag (2008)
Clarke D., Costa D., Arbab F.: Connector colouring I: synchronisation and context dependency. Sci. Comput. Program. 66(3), 205–225 (2007)
Holzmann G.J.: The model checker SPIN. IEEE Trans. Softw. Eng. 23(5), 279–295 (1997)
Hopcroft J., Motwani R., Ullman J.: Introduction to Automata Theory, Languages, and Computation. 3rd edn. Addison-Wesley, Reading (2006)
Izadi, M., Bonsangue, M.: Recasting constraint automata into Büchi automata. In: Proceedings of ICTAC 2008, LNCS, vol. 5160, pp. 156–170, Springer-Verlag (2008)
Izadi, M., Bonsangue, M., Clarke, D.: Modeling Component Connectors: synchronisation and Context-Dependency. In: Proceedings of 6th IEEE International Conference on Software Engineering and Formal Methods (SEFM 2008), pp. 303–312. IEEE Computer Society (2008)
Kaplan D.: Regular expressions and the equivalence of programs. J. Comput. Syst. Sci. 3, 361–386 (1969)
Kozen D.: Automata on guarded strings and applications. Matématica Contemporânea 24, 117–139 (2003)
Kupferman, O., Vardi, M.: Verification of fair transition systems. In: Proceedings of the 8th International Conference on Computer Aided Verification CAV, LNCS. Springer (1996)
Mousavi, M., Sirjani, M., Arbab, F.: Formal sematics and analysis of component connectors in Reo. In: Proceedings of FOCLASA 2005, ENTCS, vol. 154, pp. 83–99. Elsevier (2005)
Papadopoulos G., Arbab F.: Coordination models and languages. Adv. Comput. 46, 329–400 (1998)
Remy, D.: Efficient representation of extensible records. In: Proceedings of ACM SIGPLAN Workshop on ML and its applications, pp. 12–16 (1994)
Szyperski C., Gruntz D., Mürer S.: Component Software: Beyond Object-Oriented Programming. 2nd edn. Addison-Wesley, Reading (2002)
Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133–191. Elsevier (1990)
Vardi, M.: An automata-theoretic approach to linear temporal logic. In: LNCS, vol. 1043, pp. 238–266. Springer-Verlag (1996)
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Dr. Antonio Cerone and Dr. Stefan Gruner.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Izadi, M., Bonsangue, M. & Clarke, D. Büchi automata for modeling component connectors. Softw Syst Model 10, 183–200 (2011). https://doi.org/10.1007/s10270-010-0152-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10270-010-0152-1