A temporal concurrent constraint programming calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2239, Issue , 2001, Pages 302-316

  Palamidessi, Catuscia ^a   Valencia, Frank D ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CONSTRAINT THEORY; SEMANTICS; TIME SHARING SYSTEMS;

CONCURRENT CONSTRAINT PROGRAMMING; DENOTATIONAL SEMANTICS; PROOF SYSTEM; TEMPORAL PROPERTY; TIMED SYSTEMS;

COMPUTER PROGRAMMING;

EID: 84947908453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_21     Document Type: Conference Paper

References (21)

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.
2. G. Berry and G. Gonthier. The Esterel synchronous programming language: design, semantics, implementation. Science of Computer Programming, 19(2):87–152, November 1992.
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.
4. F. de Boer, M. Gabbrielli, and M. C. Meo. A timed concurrent constraint language. Information and Computation, 1999. To appear.
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.
6. J.F. Diaz, C. Rueda, and F. Valencia. A calculus for concurrent processes with constraints. CLEI Electronic Journal, 1(2), December 1998.
7. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Confluence in concurrent constraint programming. Theoretical Computer Science, 183(2):281–315, 1997.
8. J. Fredslund. The assumption architecture. Progress Report, Department of Computer Science, University of Aarhus, November 1999.
9. O. Herescu and C. Palamidessi. Probabilistic asynchronous pi-calculus. FoSSaCS, pages 146–160, 2000.
10. I. Hodkinson, F. Wolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. In Annals of Pure and Applied Logic, 2000.
11. H. H. Lund and L. Pagliarini. Robot soccer with LEGO mindstorms. Lecture Notes in Computer Science, 1604, 1999.
12. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer, 1991.
13. R. Milner. A finite delay operator in synchronous ccs. Technical Report CSR-116- 82, University of Edinburgh, 1992.
14. R. Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.
15. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, April 1980.
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.
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.
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.
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.
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.