Skip to main content
SpringerLink
Log in
Book cover

It's All About Coordination pp 70–85Cite as

Soft Constraint Automata with Memory

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 10865))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Francesco would like to thank Farhad for his precious mentoring during his visit at CWI as “Alain Bensoussan” Fellow during 2011–2012; Fabio for the many meetings and collaborations along the years; and Kasper for his incredible supervision job and the many interesting discussions.

  2. 2.

    For a first-order constraint \(\phi \), the support \({\text {supp}}(\phi )\) is contained in the set of free variables \({\text {free}}(\phi )\). For example, \({\text {supp}}(x=x) = \emptyset \subseteq \{x\} = {\text {free}}(x=x)\).

  3. 3.

    The operator is called projection in the soft framework, and \(\exists _x c\) is denoted \(c\Downarrow _{V-\{x\}}\).

  4. 4.

    As noted in [6], these streams do not imply time constraints, and thus our (soft) CA are not “timed” [8], so that we dropped the adjective altogether.

References

  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). https://doi.org/10.1007/978-3-540-40020-2_2

    Chapter  Google Scholar 

  2. Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329–366 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  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). https://doi.org/10.1007/978-3-642-24933-4_9

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  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). https://doi.org/10.1007/978-3-540-72794-1_16

    Chapter  Google Scholar 

  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). https://doi.org/10.1007/978-3-642-38230-7_8

    Chapter  Google Scholar 

  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). https://doi.org/10.1007/978-3-642-19805-2_10

    Chapter  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  9. Baier, C.: Probabilistic models for Reo connector circuits. Univers. Comput. Sci. 11(10), 1718–1748 (2005)

    Google Scholar 

  10. Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201–236 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  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. Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. ACM Trans. Comput. Logic 7(3), 563–589 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01492-5

    MATH  Google Scholar 

  14. Gadducci, F., Santini, F.: Residuation for bipolar preferences in soft constraints. Inf. Process. Lett. 118, 69–74 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  16. Golan, J.: Semirings and Affine Equations over Them: Theory and Applications. Kluwer, Norwell (2003)

    Book  MATH  Google Scholar 

  17. Jongmans, S.T.Q., Arbab, F.: Overview of thirty semantic formalisms for Reo. Sci. Ann. Comput. Sci. 22(1), 201–251 (2012)

    MathSciNet  Google Scholar 

  18. Jongmans, S.T.Q., Kappé, T., Arbab, F.: Constraint automata with memory cells and their composition. Sci. Comput. Program. 146, 50–86 (2017)

    Article  Google Scholar 

  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. 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). https://doi.org/10.1007/978-3-319-68034-7_2

    Chapter  Google Scholar 

  21. Meng, S., Arbab, F.: QoS-driven service selection and composition using quantitative constraint automata. Fundamenta Informaticae 95(1), 103–128 (2009)

    MathSciNet  MATH  Google Scholar 

  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. 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). https://doi.org/10.1007/978-3-642-40561-7_11

    Chapter  Google Scholar 

  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). https://doi.org/10.1007/978-3-319-34096-8_1

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centrum Wiskunde & Informatica, Amsterdam, Netherlands

    Kasper Dokter

  2. Dipartimento di Informatica, University of Pisa, Pisa, Italy

    Fabio Gadducci

  3. Dipartimento di Matematica e Informatica, University of Perugia, Perugia, Italy

    Francesco Santini

Authors
  1. Kasper Dokter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabio Gadducci
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesco Santini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francesco Santini .

Editor information

Editors and Affiliations

  1. Centre for Mathematics and Computer Science, Amsterdam, The Netherlands

    Frank de Boer

  2. Leiden University, Leiden, The Netherlands

    Marcello Bonsangue

  3. Centre for Mathematics and Computer Science, Amsterdam, The Netherlands

    Jan Rutten

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Dokter, K., Gadducci, F., Santini, F. (2018). Soft Constraint Automata with Memory. 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_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-90089-6_6

  • 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)

Publish with us

Policies and ethics

Search

Navigation