Skip to main content
SpringerLink
Log in

A Temporal Concurrent Constraint Programming Calculus

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP 2001 (CP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2239))

Abstract

The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and non-deterministic timed behavior. We call this tcc extension the ntcc calculus. The expressiveness of ntcc is illustrated by modeling cells, asynchronous bounded broadcasting and timed systems such as RCX controllers. We present a denotational semantics for the strongest-postcondition of ntcc processes and, based on this semantics, we develop a proof system for linear temporal properties of these processes.

Basic Research in Computer Science, Centre of the Danish National Research Foundation.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. G. Alvarez, J.F. Diaz, L.O. Quesada, C. Rueda, G. Tamura, F. Valencia, and G. Assayag. Integrating constraints and concurrent objects in musical applications: A calculus and its visual language. Constraints, January 2001.

    Google Scholar 

  2. G. Berry and G. Gonthier. The Esterel synchronous programming language: design, semantics, implementation. Science of Computer Programming, 19(2):87–152, November 1992.

    Article  Google Scholar 

  3. F. de Boer, M. Gabbrielli, and M. Chiara. A temporal logic for reasoning about timed concurrent constraint programs. In TIME 01. IEEE Press, 2001.

    Google Scholar 

  4. F. de Boer, M. Gabbrielli, and M. C. Meo. A timed concurrent constraint language. Information and Computation, 1999. To appear.

    Google Scholar 

  5. F. S. de Boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi. Proving concurrent constraint programs correct. ACM Transactions on Programming Languages and Systems, 19(5):685–725, 1997.

    Article  Google Scholar 

  6. J.F. Diaz, C. Rueda, and F. Valencia. A calculus for concurrent processes with constraints. CLEI Electronic Journal, 1(2), December 1998.

    Google Scholar 

  7. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Confiuence in concurrent constraint programming. Theoretical Computer Science, 183(2):281–315, 1997.

    Article  MathSciNet  Google Scholar 

  8. J. Fredslund. The assumption architecture. Progress Report, Department of Computer Science, University of Aarhus, November 1999.

    Google Scholar 

  9. O. Herescu and C. Palamidessi. Probabilistic asynchronous pi-calculus. FoSSaCS, pages 146–160, 2000.

    Google Scholar 

  10. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. In Annals of Pure and Applied Logic, 2000.

    Google Scholar 

  11. H. H. Lund and L. Pagliarini. Robot soccer with LEGO mindstorms. Lecture Notes in Computer Science, 1604, 1999.

    Google Scholar 

  12. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer, 1991.

    Google Scholar 

  13. R. Milner. A finite delay operator in synchronous ccs. Technical Report CSR-116-82, University of Edinburgh, 1992.

    Google Scholar 

  14. R. Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.

    Google Scholar 

  15. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, April 1980.

    Article  MathSciNet  Google Scholar 

  16. V. Saraswat, R. Jagadeesan, and V. Gupta. Foundations of timed concurrent constraint programming. In Proc. of the Ninth Annual IEEE Symposium on Logic in Computer Science, pages 71–80, 4-7 July 1994.

    Google Scholar 

  17. V. Saraswat, R. Jagadeesan, and V. Gupta. Timed default concurrent constraint programming. Journal of Symbolic Computation, 22(5–6):475–520, November-December 1996.

    Article  MathSciNet  Google Scholar 

  18. V. Saraswat, M. Rinard, and P. Panangaden. The semantic foundations of concurrent constraint programming. In POPL’ 91. Proceedings of the eighteenth annual ACM symposium on Principles of programming languages, pages 333–352, 21-23 January 1991.

    Google Scholar 

  19. G. Smolka. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pages 324–343. Springer-Verlag, Berlin, 1995.

    Chapter  Google Scholar 

  20. F. Valencia. Reactive constraint programming. Progress Report, BRICS, June 2000. Availabe via http://www.brics.dk/~fvalenci/publications.html.

  21. G. Winskel. The Formal Semantics of Programming Languages. The MIT Press, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Penn State University, USA

    Catuscia Palamidessi

  2. BRICS, University of Aarhus, Denmark

    Frank D. Valencia

Authors
  1. Catuscia Palamidessi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank D. Valencia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of York, YO10 5DD, Heslington, York, UK

    Toby Walsh

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Palamidessi, C., Valencia, F.D. (2001). A Temporal Concurrent Constraint Programming Calculus. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-45578-7_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42863-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation