Skip to main content
SpringerLink
Log in

Models for concurrent constraint programming

  • Conference paper
  • First Online:
CONCUR '96: Concurrency Theory (CONCUR 1996)

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

Included in the following conference series:

Abstract

Concurrent constraint programming is a simple but powerful frame-work for computation based on four basic computational ideas: concurrency (multiple agents are simultaneously active), communication (they interact via the monotonic accumulation of constraints on shared variables), coordination (the presence or absence of information can guard evolution of an agent), and localization (each agent has access to only a finite, though dynamically varying, number of variables, and can create new variables on the fly). Unlike other foundational models of concurrency such as CCS, CSP, Petri nets and the π-calculus, such flexibility is already made available within the context of determinate computation. This allows the development of a rich and tractable theory of concurrent processes within the context of which additional computational notion such as indeterminacy, reactivity, instantaneous interrupts and continuous (dense-time) autonomous evolution have been developed.

We survey the development of some of these extensions and the relationships between their semantic models.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Benveniste and G. Berry, editors. Another Look at Real-time Systems, September 1991. Special issue of the Proceedings of the IEEE.

    Google Scholar 

  2. G. Berry. Preemption in concurrent systems. In Proc. of FSTTCS. Springer-Verlag, 1993. LNCS 781.

    Google Scholar 

  3. A. Benveniste and P. Le Guernic. Hybrid dynamical systems and the signal language. IEEE Transactions on Automatic control, 35(5):535–546, 1990.

    Google Scholar 

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

    Google Scholar 

  5. E. M. Clarke, D. E. Long, and K. L. McMillan. A language for compositional specification and verification of finite state hardware controllers. In Benveniste and Berry [BB91]. Special issue of the Proceedings of the IEEE.

    Google Scholar 

  6. J. W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, editors. REX workshop “Real time: Theory in Practice”, volume 600 of Lecture Notes in Computer Science. Springer Verlag, 1992.

    Google Scholar 

  7. Johan de Kleer and John Seely Brown. Qualitative Reasoning about Physical Systems, chapter Qualitative Physics Based on Confluences. MIT Press, 1985. Also published in AIJ, 1984.

    Google Scholar 

  8. P. LeGuernic, M. Le Borgne, T. Gauthier, and C. le Maire. Programming real time applications with signal. In Benveniste and Berry [BB91]. Special issue of the Proceedings of the IEEE.

    Google Scholar 

  9. Vineet Gupta, Radha Jagadeesan, and Vijay Saraswat. Computing with continuous change. Science of Computer Programming. To appear.

    Google Scholar 

  10. Vineet Gupta, Radha Jagadeesan, and Vijay Saraswat. Hybrid cc, hybrid automata and program verification. In Alur, Henzinger, and Sontag, editors, Hybrid Systems III, Lecture Notes in Computer Science. Springer Verlag, 1996. To appear.

    Google Scholar 

  11. Vineet Gupta, Radha Jagadeesan, Vijay Saraswat, and Daniel Bobrow. Programming in hybrid constraint languages. In Panos Antsaklis, Wolf Kohn, Anil Nerode, and Sankar Sastry, editors, Hybrid Systems II, volume 999 of Lecture Notes in Computer Science, pages 226–251. Springer Verlag, November 1995.

    Google Scholar 

  12. Robert Grossman, Anil Nerode, Anders Ravn, and Hans Rischel, editors. Hybrid Systems, volume 736 of Lecture Notes in Computer Science. Springer Verlag, 1993.

    Google Scholar 

  13. D. Harel. Statecharts: A visual approach to complex systems. Science of Computer Programming, 8:231–274, 1987.

    Google Scholar 

  14. N. Halbwachs, P. Caspi, and D. Pilaud. The synchronous programming language lustre. In Benveniste and Berry [BB91]. Special issue of the Proceedings of the IEEE.

    Google Scholar 

  15. Pascal Van Hentenryck, Vijay A. Saraswat, and Yves Deville. Constraint processing in cc(fd). Technical report, Computer Science Department, Brown University, 1992.

    Google Scholar 

  16. O. Maler, Z. Manna, and A. Pnueli. From timed to hybrid systems. In de Bakker et al. [dBHdRR92], pages 447–484.

    Google Scholar 

  17. X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In de Bakker et al. [dBHdRR92].

    Google Scholar 

  18. Ray Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Google Scholar 

  19. Vijay A. Saraswat. The Category of Constraint Systems is Cartesian-closed. In Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, 1992.

    Google Scholar 

  20. Gert Smolka, Henz, and J. Werz. Constraint Programming: The Newport Papers, chapter Object-oriented programming in Oz. MIT Press, 1994.

    Google Scholar 

  21. V. A. Saraswat, R. Jagadeesan, and V. Gupta. Timed Default Concurrent Constraint Programming. Journal of Symbolic Computation. To appear. Extended abstract appeared in the Proceedings of the 22nd ACM Symposium on Principles of Programming Languages, San francisco, January 1995.

    Google Scholar 

  22. V. A. Saraswat, R. Jagadeesan, and V. Gupta. Foundations of Timed Concurrent Constraint Programming. In Samson Abramsky, editor, Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, pages 71–80. IEEE Computer Press, July 1994.

    Google Scholar 

  23. V. A. Saraswat, R. Jagadeesan, and V. Gupta. Programming in timed concurrent constraint languages. In B.Mayoh, E.Tougu, and J.Penjam, editors, Constraint Programming, volume 131 of NATO Advanced Science Institute Series F: Computer and System Sciences, pages 367–413. Springer-Verlag, 1994.

    Google Scholar 

  24. V. A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In Proceedings of Eighteenth ACM Symposium on Principles of Programming Languages, Orlando, January 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xerox PARC, 3333 Coyote Hill Road, 94304, Palo Alto, Ca

    Vineet Gupta & Vijay Saraswat

  2. Dept. of Mathematical Sciences, Loyola University, Lake Shore Campus, 60626, Chicago, Il

    Radha Jagadeesan

Authors
  1. Vineet Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Radha Jagadeesan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vijay Saraswat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gupta, V., Jagadeesan, R., Saraswat, V. (1996). Models for concurrent constraint programming. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61604-7

  • Online ISBN: 978-3-540-70625-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation