Skip to main content
SpringerLink
Log in

Timed Soft Concurrent Constraint Programs

  • Conference paper
Coordination Models and Languages (COORDINATION 2008)

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

Included in the following conference series:

Abstract

We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock. Action prefixing is then considered as the syntactic marker which distinguishes a time instant from the next one. Supported by soft constraints instead of crisp ones, tell and ask agents are now equipped with a preference (or consistency) threshold which is used to determine their success or suspension. In the paper we provide a language to describe the agents behavior, together with its operational and denotational semantics, for which we also prove the compositionality and correctness properties. Agents negotiating Quality of Service can benefit from this new language, by coordinating among themselves and mediating their preferences.

The first and fourth authors are supported by the MIUR PRIN 2005-015491.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berry, G., Gonthier, G.: The esterel synchronous programming language: design, semantics, implementation. Sci. Comput. Program. 19(2), 87–152 (1992)

    Article  MATH  Google Scholar 

  2. Bistarelli, S.: Semirings for Soft Constraint Solving and Programming (LNCS). Springer-Verlag, Heidelberg (2004)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. ACM Trans. Comput. Logic 7(3), 563–589 (2006)

    Article  MathSciNet  Google Scholar 

  5. Bistarelli, S., Santini, F.: A nonmonotonic soft constraint based language to model QoS negotiation. In: Doctoral Consortium of AAAI 2008, AAAI Press, Menlo Park (2008) (to appear)

    Google Scholar 

  6. Bortolussi, L.: Stochastic concurrent constraint programming. Electr. Notes Theor. Comput. Sci. 164(3), 65–80 (2006)

    Article  MathSciNet  Google Scholar 

  7. Brookes, S.D.: Full abstraction for a shared variable parallel language. In: LICS, pp. 98–109. IEEE Computer Society, Los Alamitos (1993)

    Google Scholar 

  8. de Boer, F.S., Gabbrielli, M., Meo, M.C.: A timed concurrent constraint language. Inf. Comput. 161(1), 45–83 (2000)

    Article  MATH  Google Scholar 

  9. de Boer, F.S., Gabbrielli, M., Meo, M.C.: A timed linda language and its denotational semantics. Fundam. Inf. 63(4), 309–330 (2004)

    MATH  Google Scholar 

  10. de Boer, F.S., Palamidessi, C.: A fully abstract model for concurrent constraint programming. In: CAAP 1991 and TAPSOFT 1991, vol. 1, pp. 296–319. Springer-Verlag New York, Inc. (1991)

    Google Scholar 

  11. Di Pierro, A., Wiklicky, H.: Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 446–455. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Halbwachs, N., Caspi, P., Raymond, P., Pilaud, D.: The synchronous data-flow programming language LUSTRE. Proceedings of the IEEE 79(9), 1305–1320 (1991)

    Article  Google Scholar 

  13. Harel, D.: Statecharts: A visual formalism for complex systems. Sci. Comput. Program. 8(3), 231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Jonsson, B.: A model and proof system for asynchronous networks. In: PODC 1985: Proceedings ACM symposium on Principles of distributed computing, New York, USA, pp. 49–58. ACM Press, New York (1985)

    Chapter  Google Scholar 

  15. le Guernic, P., le Borgne, M., Gautier, T., le Maire, C.: Programming real-time applications with signal. Proceedings of the IEEE 79(9), 1321–1336 (1991)

    Article  Google Scholar 

  16. Nielsen, M., Valencia, F.D.: Temporal concurrent constraint programming: Applications and behavior. In: Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg, London, UK, pp. 298–324. Springer, Heidelberg (2002)

    Google Scholar 

  17. Palamidessi, C., Valencia, F.D.: A Temporal Concurrent Constraint Programming Calculus. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 302–316. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Peltz, C.: Web services orchestration and choreography. Computer 36(10), 46–52 (2003)

    Article  Google Scholar 

  19. Saraswat, V.: Concurrent constraint programming languages, PhD thesis (January 1989)

    Google Scholar 

  20. Saraswat, V., Jagadeesan, R., Gupta, V.: Timed default concurrent constraint programming. J. Symb. Comput. 22(5-6), 475–520 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  21. Valencia, F.D.: Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 422–437. Springer, Heidelberg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze, Università “G. D’Annunzio” di Chieti-Pescara, Italy

    Stefano Bistarelli & Maria Chiara Meo

  2. Istituto di Informatica e Telematica (CNR), Pisa, Italy

    Stefano Bistarelli & Francesco Santini

  3. Dipartimento di Scienze dell’Informazione, Università di Bologna, Italy

    Maurizio Gabbrielli

  4. IMT - Institute for Advanced Studies, Lucca, Italy

    Francesco Santini

Authors
  1. Stefano Bistarelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurizio Gabbrielli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maria Chiara Meo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Francesco Santini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Doug Lea Gianluigi Zavattaro

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bistarelli, S., Gabbrielli, M., Meo, M.C., Santini, F. (2008). Timed Soft Concurrent Constraint Programs. In: Lea, D., Zavattaro, G. (eds) Coordination Models and Languages. COORDINATION 2008. Lecture Notes in Computer Science, vol 5052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68265-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68265-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68264-6

  • Online ISBN: 978-3-540-68265-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation