Abstract
Reo is a visual language of connectors that originated in component-based software engineering. It is a flexible and intuitive language, yet powerful and capable of expressing complex patterns of composition. The intricacies of the language resulted in many semantic models proposed for Reo, including several automata-based ones.
In this paper, we show how to generalize a known active automata learning algorithm—Angluin’s L*—to Reo automata. We use recent categorical insights on Angluin’s original algorithm to devise this generalization, which turns out to require a change of base category.
Coördineren kun je leren — dedicated to Farhad Arbab on the occasion of his retirement
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
What follows works also for discrete orders on S and E. Acknowledging the additional structure, however, allows us to explicitly save queries by exploiting the monotonicity of the row function.
References
Adámek, J., Rosický, J.: Locally Presentable and Accessible Categories. Cambridge University Press, Cambridge (1994)
Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
Arbib, M.A., Manes, E.G.: Adjoint machines, state-behavior machines, and duality. J. Pure Appl. Algebra 6(3), 313–344 (1975)
Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modeling component connectors in reo by constraint automata. Sci. Comput. Program. 61(2), 75–113 (2006). https://doi.org/10.1016/j.scico.2005.10.008
Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Berlin (1985). Revised and corrected version available from www.cwru.edu/artsci/math/wells/pub/ttt.html
Bonsangue, M., Clarke, D., Silva, A.: Automata for context-dependent connectors. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol. 5521, pp. 184–203. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02053-7_10
Jacobs, B., Silva, A.: Automata learning: a categorical perspective. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds.) Horizons of the Mind. A Tribute to Prakash Panangaden. LNCS, vol. 8464, pp. 384–406. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-06880-0_20
Jongmans, S.T.Q., Arbab, F.: Global consensus through local synchronization: a formal basis for partially-distributed coordination. Sci. Comput. Program. 115–116, 199–224 (2016)
Kalman, R.: On the general theory of control systems. IRE Trans. Autom. Control 4(3), 110 (1959)
Milius, S.: A sound and complete calculus for finite stream circuits. In: Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, Edinburgh, United Kingdom, 11–14 July 2010, pp. 421–430 (2010). https://doi.org/10.1109/LICS.2010.11
Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86–95 (2017). https://doi.org/10.1145/2967606
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
van Heerdt, G., Jacobs, B., Kappé, T., Silva, A. (2018). Learning to Coordinate. In: de Boer, F., Bonsangue, M., Rutten, J. (eds) It's All About Coordination. Lecture Notes in Computer Science(), vol 10865. Springer, Cham. https://doi.org/10.1007/978-3-319-90089-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-90089-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-90088-9
Online ISBN: 978-3-319-90089-6
eBook Packages: Computer ScienceComputer Science (R0)