A timed concurrent constraint language

Information and Computation

Volumn 161, Issue 1, 2000, Pages 45-83

  De Boer, F S ^a   Gabbrielli, M ^b   Meo, M C ^c  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT ENGINEERING; CONSTRAINT THEORY; SCHEDULING; SEMANTICS;

TIMED CONCURRENT CONSTRAINT LANGUAGES (TCCP);

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034714631     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2879     Document Type: Article

References (44)

1. Aceto, L., and Murphy, D. (1996), Timing and causality in process algebra, Acta Inform. 33, 317-350.
2. Baeten, J., and Bergstra, J. (1991), Real time process algebra, Formal Aspects Comput. 3, 142-188.
3. von der Beeck, M. (1994), "A Comparison of Statecharts Variants," Lecture Notes in Computer Science, Vol. 863, pp. 128-148, Springer-Verlag, Berlin.
4. Berry, G. (1993), Preemption in concurrent systems, in "Proc. of FSTTCS," Lecture Notes in Computer Science, Vol. 761, pp. 72-92, Springer-Verlag, Berlin.
5. Berry, G., and Gonthier, G. (1992), The ESTEREL programming language: Design, semantics and implementation, Sci. Comput. Programming 19, 87-152.
6. Birkhoff, G. (1967), "Lattice Theory," AMS Colloquium Publications, Vol. XXV, 3rd ed., Amer. Math. Soc., Providence, RI.
7. de Boer, F. S., and Gabbrielli, M. (1995), Modeling real-time in concurrent constraint programming, in "Proc. Int'l Logic Programming Symposium (ILPS'95)" (J. Lloyd, Ed.), The MIT Press, Cambridge, MA.
8. de Boer, F. S., Gabbrielli, M., and Meo, M. C. (1997), Semantics and expressive power of a timed concurrent constraint language, in "Proc. Third Int'l Conf. on Principles and Practice of Constraint Programming (CP 97)" (G. Smolka, Ed.), Lecture Notes in Computer Science, Springer-Verlag, Berlin.
9. de Boer, F. S., Gabbrielli, M., Marchiori, E., and Palamidessi, C. (1997), Proving concurrent constraint programs correct, Trans. Programming Languages Systems (TOPLAS) 19, 685-725.
10. de Boer, F. S., Kok, J. N., Palamidessi, C. and Rutten, J. J. M. M. (1991), The failure of failures in a paradigm for asynchronous communication, in "Proceedings of CONCUR'91" (J. C. M. Baeten and J. F. Groote, Eds.), Lecture Notes in Computer Science, Vol. 527, pp. 111-126, Springer-Verlag, Berlin.
11. de Boer, F. S., Kok, J. N., Palamidessi, C. and Rutten, J. J. M. M. (1992), On blocks: locality and asynchronous communication, in "Proc. of REX workshop on Semantics - Foundations and Applications," Lecture Notes in Computer Science, Vol. 666, pp. 73-90, Springer-Verlag, Berlin.
12. de Boer, F. S., and Palamidessi, C. (1991), A fully abstract model for concurrent constraint programming, in "Proc. of TAPSOFT/CAAP" (S. Abramsky and T. S. E. Maibaum, Eds.), Lecture Notes in Computer Science, Vol. 493, pp. 296-319, Springer-Verlag, Berlin.
13. de Boer, F. S., and Palamidessi, C. (1991), Embedding as a tool for language comparison, Inform. and Comput. 108, 128-157.
14. Bremond-Gregoire, P., and Lee, I. (1997), A process algebra of communicating shared resources with dense time and priorities, Theoret. Comput. Sci. 189.
15. Brookes, S. (1993), A fully abstract semantics of a shared variable parallel language, in "Proc. Eighth IEEE Symposium on Logic In Computer Science," IEEE Computer Society Press, Los Alamitos, CA.
16. Falaschi, M., Gabbrielli, M., Marriott, K., and Palamidessi, C. (1993), Compositional analysis for concurrent constraint programming, in "Proc. Eighth IEEE Symp. on Logic In Computer Science," pp. 210-221, IEEE Computer Society Press, Los Alamitos, CA.
17. Falaschi, M., Gabbrielli, M., Marriott, K., and Palamidessi, C. (1995), Confluence and concurrent constraint programming, in "Proc. AMAST 95," Lecture Notes in Computer Science, Vol. 936, pp. 531-545, Springer-Verlag, Berlin.
18. Fisher, M. (1996), An introduction to executable temporal logics, Knowledge Engrg. Rev. 6, 43-56.
19. Fisher, M., Kono, S., and Orgun, M. A., Eds. (1996), Special issue on executable temporal logics, J. Symbolic Comput. 22.
20. Hennessy, M., and Regan, T. (1995), A temporal process algebra, Inform. and Comput. 117, 221-239.
21. Giacobazzi, R., Palamidessi, C., and Ranzato, F. (1996), Weak relative pseudo-complements of closure operators, Algebra Universalis 36, 405-412.
22. Halbwachs, N. (1993), "Synchronous programming of reactive systems," Kluwer Academic, Dordrecht/Norwell.
23. Halbwachs, N., Caspi, P., and Pilaud, D. (1991), The synchronous programming language LUSTRE, in "Proc. Special Issue on Another Look at Real-Time Systems," IEEE Computer Society Press, Los Alamitos, CA.
24. Harel, D. (1987), Statecharts: A visual formalism for complex systems, Sci. Comput. Programming 8, 231-274.
25. Harel, D., and Pnueli, A. (1985), Logics and models of concurrent systems, in "On the Development of Reactive Systems" (K. R. Ant, Ed.), Vol. 13, pp. 471-498, NATO Advanced Study Institute.
26. Henkin, L., Monk, J. D., and Tarski, A. (1971), "Cylindric Algebras (Part I)," North-Holland, Amsterdam.
27. Jaffar, J., and Maher, M. J. (1994), Constraint logic programming: A survey, J. Logic Programming 19/20, 503-581.
28. Jonsson, B. (1985), A model and a proof system for asynchronous processes, in "Proc. of the 4th ACM Symp. on Principles of Distributed Computing," pp. 49-58.
29. Guernic, P. L., Borgue, M. L., Gauthier, T., and Marie, C. L. (1991), Programming real time applications with SIGNAL, in "Proc. Special issue on Another Look at Real-Time Systems," IEEE Computer Society Press, Los Alamitos, CA.
30. Lee, I., Ben-Abdallah, H., and Choi, J.-Y. (1996), A process algebraic method for the specification and analysis of real-time systems, in "Formal Methods for Real-Time Computing" (C. Heitmeyer and D. Mandrioli, Eds.), Wiley, New York.
31. Marriott, K., and Oderski, M. (1995), A confluent calculus for concurrent constraint programming with guarded choice, in "Proc. Int'l Conf. on Principles and Practice of Constraint Programming (CP95)," Lecture Notes in Computer Science, Springer-Verlag, Berlin.
32. Moller, F., and Tofts, C. (1990), A temporal calculus of communicating systems, in "Proc. CONCUR 90," Lecture Notes in Computer Science, Vol. 459, pp. 401-414, Springer-Verlag, Berlin.
33. Moszkowski, B. (1986), "Executing Temporal Logic Programs," Cambridge University Press, Cambridge, MA.
34. Panangaden, P., and Shanbhogue, V. (1992), The expressive power of indeterminate data-flow primitives, Inform. and Comput. 98, 99-131.
35. Manna, Z., and Pnueli, A. (1991), "The Temporal Logic of Reactive Systems," Springer-Verlag, Berlin.
36. Saraswat, V. A. (1991), "Concurrent Constraint Programming Languages," Ph.D. thesis, Carnegie-Mellon University, January 1989. Published by The MIT Press, Cambridge, MA.
37. Shapiro, E. Y. (1989), The family of concurrent logic programming languages, ACM Comput. Surveys 21, 412-510.
38. Saraswat, V. A., and Rinard, M. (1990), Concurrent constraint programming, in "Proc. of Seventeenth ACM Symposium on Principles of Programming Languages," pp. 232-245, ACM Press, New York.
39. Saraswat, V. A., Rinard, M., and Panangaden, P. (1991), Semantic foundations of concurrent constraint programming, in "Proc. Eighteenth ACM Symposium on Principles of Programming Languages," pp. 333-353, ACM Press, New York.
40. Saraswat, V. A., Jagadeesan, R., and Gupta, V. (1994), Foundations of timed concurrent constraint programming, in "Proc. of the Ninth IEEE Symposium on Logic in Computer Science" (S. Abramsky, Ed.), pp. 71-80, IEEE Computer Press, Los Alamitos, CA.
41. Saraswat, V. A., Jagadeesan, R., and Gupta, V. (1996), Timed default concurrent constraint programming, J. Symbolic Comput. 22, 475-520.
42. Scott, D. (1982), Domains for denotational semantics, in "Proc. of ICALP."
43. Smolka, G. (1995), The definition of Kernel Oz, in "Constraints: Basics and Trends" (A. Podelski, Ed.), Lecture Notes in Computer Science, Vol. 910, pp. 251-292, Springer-Verlag, Berlin.
44. Smolka, G. (1995), The Oz programming model, in "Computer Science Today" (J. van Leeuwen, Ed.), Lecture Notes in Computer Science, Vol. 1000, Springer-Verlag, Berlin.