Soft Constraint Automata with Memory

  • Kasper Dokter
  • Fabio Gadducci
  • Francesco SantiniEmail author
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10865)


In this paper, we revise the notion of Soft Constraint Automata, where automata transitions are weighted and consequently each action is associated with a preference value. We first relax the underlying algebraic structure that models preferences, with the purpose to use bipolar preferences (i.e., both positive and negative ones). Then, we equip automata with memory cells, that is, with an internal state to remember and update information from transition to transition. Finally, we revise automata operators, as join and hiding.


Constraint automata with memory Soft constraints 


  1. 1.
    Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2002. LNCS, vol. 2755, pp. 34–55. Springer, Heidelberg (2003). Scholar
  2. 2.
    Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329–366 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Arbab, F.: Puff, the magic protocol. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Formal Modeling: Actors, Open Systems, Biological Systems. LNCS, vol. 7000, pp. 169–206. Springer, Heidelberg (2011). Scholar
  4. 4.
    Arbab, F., Baier, C., de Boer, F.S., Rutten, J.J.M.M.: Models and temporal logical specifications for timed component connectors. Softw. Syst. Model. 6(1), 59–82 (2007)CrossRefGoogle Scholar
  5. 5.
    Arbab, F., Chothia, T., Meng, S., Moon, Y.-J.: Component connectors with QoS guarantees. In: Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. LNCS, vol. 4467, pp. 286–304. Springer, Heidelberg (2007). Scholar
  6. 6.
    Arbab, F., Santini, F.: Preference and similarity-based behavioral discovery of services. In: ter Beek, M.H., Lohmann, N. (eds.) WS-FM 2012. LNCS, vol. 7843, pp. 118–133. Springer, Heidelberg (2013). Scholar
  7. 7.
    Aristizábal, A., Bonchi, F., Palamidessi, C., Pino, L., Valencia, F.: Deriving labels and bisimilarity for concurrent constraint programming. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 138–152. Springer, Heidelberg (2011). Scholar
  8. 8.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Baier, C.: Probabilistic models for Reo connector circuits. Univers. Comput. Sci. 11(10), 1718–1748 (2005)Google Scholar
  10. 10.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201–236 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI 2006. FAIA, vol. 141, pp. 63–67. IOS Press (2006)Google Scholar
  12. 12.
    Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. ACM Trans. Comput. Logic 7(3), 563–589 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009). Scholar
  14. 14.
    Gadducci, F., Santini, F.: Residuation for bipolar preferences in soft constraints. Inf. Process. Lett. 118, 69–74 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Gadducci, F., Santini, F., Pino, L.F., Valencia, F.D.: Observational and behavioural equivalences for soft concurrent constraint programming. Log. Algebr. Methods Program. 92, 45–63 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Golan, J.: Semirings and Affine Equations over Them: Theory and Applications. Kluwer, Norwell (2003)CrossRefzbMATHGoogle Scholar
  17. 17.
    Jongmans, S.T.Q., Arbab, F.: Overview of thirty semantic formalisms for Reo. Sci. Ann. Comput. Sci. 22(1), 201–251 (2012)MathSciNetGoogle Scholar
  18. 18.
    Jongmans, S.T.Q., Kappé, T., Arbab, F.: Constraint automata with memory cells and their composition. Sci. Comput. Program. 146, 50–86 (2017)CrossRefGoogle Scholar
  19. 19.
    Kappé, T., Arbab, F., Talcott, C.L.: A compositional framework for preference-aware agents. In: Kargahi, M., Trivedi, A. (eds.) V2CPS@IFM 2016. EPTCS, vol. 232, pp. 21–35 (2016)Google Scholar
  20. 20.
    Kappé, T., Arbab, F., Talcott, C.: A component-oriented framework for autonomous agents. In: Proença, J., Lumpe, M. (eds.) FACS 2017. LNCS, vol. 10487, pp. 20–38. Springer, Cham (2017). Scholar
  21. 21.
    Meng, S., Arbab, F.: QoS-driven service selection and composition using quantitative constraint automata. Fundamenta Informaticae 95(1), 103–128 (2009)MathSciNetzbMATHGoogle Scholar
  22. 22.
    Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Wise, D.S. (ed.) POPL 1991, pp. 333–352. ACM Press (1991)Google Scholar
  23. 23.
    Sargolzaei, M., Santini, F., Arbab, F., Afsarmanesh, H.: A tool for behaviour-based discovery of approximately matching web services. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol. 8137, pp. 152–166. Springer, Heidelberg (2013). Scholar
  24. 24.
    Talcott, C., Nigam, V., Arbab, F., Kappé, T.: Formal specification and analysis of robust adaptive distributed cyber-physical systems. In: Bernardo, M., De Nicola, R., Hillston, J. (eds.) SFM 2016. LNCS, vol. 9700, pp. 1–35. Springer, Cham (2016). Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Kasper Dokter
    • 1
  • Fabio Gadducci
    • 2
  • Francesco Santini
    • 3
    Email author
  1. 1.Centrum Wiskunde & InformaticaAmsterdamNetherlands
  2. 2.Dipartimento di InformaticaUniversity of PisaPisaItaly
  3. 3.Dipartimento di Matematica e InformaticaUniversity of PerugiaPerugiaItaly

Personalised recommendations