Skip to main content
SpringerLink
Log in
Book cover

Formal and Natural Computing pp 298–321Cite as

Temporal Concurrent Constraint Programming: Applications and Behavior

  • Chapter
  • First Online:

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

Abstract

The ntcc calculus is a model of non-deterministic temporal concurrent constraint programming. In this paper we study behavioral notions for this calculus. In the underlying computational model, concurrent constraint processes are executed in discrete time intervals. The behavioral notions studied reflect the reactive interactions between concurrent constraint processes and their environment, as well as internal interactions between individual processes. Relationships between the suggested notions are studied, and they are all proved to be decidable for a substantial fragment of the calculus. Furthermore, the expressive power of this fragment is illustrated by examples.

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Benda, V. Jagannathan, and R. Dodhiawala. On Optimal Cooperation of Knowledge Sources— An Empirical Investigation. Technical Report BCS-G2010-28, Boeing Advanced Technology Center, 1986.

    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  MATH  Google Scholar 

  3. J. R. Buchi. On a Decision Method in Restricted Second Order Arithmetic. In Proc. Int. Cong. on Logic, Methodology, and Philosophy of Science, pages 1–11. Stanford University Press, 1962.

    Google Scholar 

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

  5. F. de Boer, M. Gabbrielli, and M. C. Meo. A Timed Concurrent Constraint Language. Information and Computation, 1999. To appear.

    Google Scholar 

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

  7. J. Fredslund. The Assumption Architecture. Progress Report, Department of Computer Science, University of Aarhus, November 1999.

    Google Scholar 

  8. V. Gupta, R. Jagadeesan, and P. Panangaden. Stochastic Processes as Concurrent Constraint Programs. In Symposium on Principles of Programming Languages, pages 189–202, 1999.

    Google Scholar 

  9. V. Gupta, R. Jagadeesan, and V. Saraswat. Models for Concurrent Constraint Programming. In Ugo Montanari and Vladimiro Sassone, Editors, CONCUR’ 96: Concurrency Theory, 7th International Conference, volume 1119 of Lecture Notes in Computer Science, pages 66–83, 26–29 August 1996.

    Google Scholar 

  10. V. Gupta, R. Jagadeesan, and V. Saraswat. Probabilistic Concurrent Constraint Programming. In CONCUR’ 97: Concurrency Theory, 8th International Conference, volume 1243 of LNCS, pages 243–257, 1–4 July 1997.

    Google Scholar 

  11. T. Haynes and S. Sen. The Evolution of Multiagent Coordination Strategies. Adaptive Behavior, 1997.

    Google Scholar 

  12. O. Herescu and C. Palamidessi. Probabilistic Asynchronous Pi-calculus. FoSSaCS, pages 146–160, 2000.

    Google Scholar 

  13. H. H. Lund and L. Pagliarini. Robot Soccer with LEGO Mindstorms. Lecture Notes in Computer Science, 1604, 1999.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  16. S. Nolfi and D. Floreano. Coevolving Predator and Prey Robots: Do “Arms Races” Arise in Artificial Evolution? Artificial Life, 4(4):311–335, 1998.

    Article  Google Scholar 

  17. C. Palamidessi and F. Valencia. A Temporal Concurrent Constraint Programming Calculus. In Proc. of the Seventh International Conference on Principles and Practice of Constraint Programming, 26 November 2001.

    Google Scholar 

  18. C. Palamidessi and F. Valencia. A Temporal Constraint Programming Calculus. Technical Report RS-01-20, BRICS, University of Aarhus, June 2001. availabevia http://www.brics.dk/~fvalenci/publications.html.

  19. V. Saraswat. Concurrent Constraint Programming. The MIT Press, Cambridge, MA, 1993.

    Google Scholar 

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

  21. 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  MATH  MathSciNet  Google Scholar 

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

  23. A. Sistla, M. Vardi, and P. Wolper. The Complementation Problem for Buchi Automata with Applications to Temporal Logic. Theoretical Computer Science, 49:217–237, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  24. G. Smolka. A Foundation for Concurrent Constraint Programming. In Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, Munich, Germany, September 1994. Invited Talk.

    Chapter  Google Scholar 

  25. P. Stone and M. Veloso. Multiagent Systems: A Survey from a Machine Learning Perspective. Autonomous Robots, 8:345–383, 2000.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, building 540, 8000, Århus C, Denmark

    Mogens Nielsen & Frank D. Valencia

Authors
  1. Mogens Nielsen
    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. Computer Science Department, Technical University of Munich, Arcisstraße 21, 80333, Munich, Germany

    Wilfried Brauer

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  4. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nielsen, M., Valencia, F.D. (2002). Temporal Concurrent Constraint Programming: Applications and Behavior. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45711-9_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43190-9

  • Online ISBN: 978-3-540-45711-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation