Infinite behaviour and fairness in concurrent constraint programming

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

Volumn 666 LNCS, Issue , 1993, Pages 348-383

  Kwiatkowska, Marta ^a,b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Concurrent constraint programming; Fairness; Liveness; Semantic properties

Indexed keywords

CONSTRAINT THEORY; SEMANTICS;

CONCURRENCY OPERATORS; CONCURRENT CONSTRAINT PROGRAMMING; CONSTRAINT SYSTEMS; FAIRNESS; FAIRNESS PROPERTIES; LIVENESS; PROCESS LANGUAGES; SEMANTIC PROPERTIES;

COMPUTER PROGRAMMING;

EID: 84956858339     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56596-5_40     Document Type: Conference Paper

References (22)

1. S. Abramsky. Domain theory in logical form. In Proceedings, Annual Symposium on Logic in Computer Science, pages 47–53. IEEE CS, 1987.
2. S. Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51:1–77, 1991.
3. B. Davey and H. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
4. F. de Boer and C. Palamidessi. A fully abstract model for concurrent constraint programming. In S. Abramsky and T. Maibaum, editors, Proc. of TAPSOFT/CAAP, volume 493 of Lecture Notes in Computer Science, pages 296–319. Springer-Verlag, 1991.
5. N. Francez. Fairness. Springer-Verlag, 1986.
6. G. Gierz, K. Hofmann, K. Keimel, J. Lawson, M. Mislove, and D. Scott. A Compendium of Continuous Lattices. Springer-Verlag, 1980.
7. C. Gunter and D. Scott. Semantic domains. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers, 1990.
8. R. Jagadeesan, V. A. Saraswat, and V. Shanbogue. Angelic non-determinism in concurrent constraint programming. Technical report, System Sciences Laboratory, Xerox PARC, 1991.
9. P. T. Johnstone. Stone Spaces. Cambridge University Press, 1982.
10. M. Z. Kwiatkowska. Event fairness and non-interleaving concurrency. Formal Aspects of Computing, 1(3):213–228, 1989.
11. M. Z. Kwiatkowska. Survey of fairness notions. Information and Software Technology, 31(7):371–386, 1989.
12. M. Z. Kwiatkowska. Defining process fairness for non-interleaving concurrency. In K. Nori and Veni-Madhavan, editors, Foundations of Software Technology and Theoretical Computer Science, volume 472 of Lecture Notes in Computer Science, pages 286–300. Springer-Verlag, 1990.
13. Z. Kwiatkowska. On topological characterization of behavioural properties. In G. Reed, A. Roscoe, and R. Wachter, editors, Topology and Category Theory in Computer Science, pages 153–177. Oxford University Press, 1991.
14. L. Lamport. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering, SE-3(2):125–143, 1977.
15. Z. Manna and A. Pnueli. A hierarchy of temporal properties. In Proceedings, 9th ACM Symposium on Principles of Distributed Computing, pages 377–408. ACM Press, 1990.
16. D. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer-Verlag, 1981.
17. G. D. Plotkin. Post-graduate lecture notes in advanced domain theory. Incorporating the “Pisa Notes”, 1981.
18. V. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of the seventeenth ACM Symposium on Principles of Programming Languages, pages 232–245. ACM, New York, 1990.
19. V. Saraswat, M. Rinard, and P. Panangaden. A fully abstract semantics for concurrent constraint programming. In Proc. of the eighteenth ACM Symposium on Principles of Programming Languages. ACM, New York, 1991.
20. H. Simmons. Frames: the point-free approach to topology. Lecture notes for a Logic for IT course, 1989.
21. M. B. Smyth. Power domains and predicate transformers: A topological view. In Automata, Languages and Programming, volume 154 of Lecture Notes in Computer Science. Springer, 1983.
22. S. Vickers. Topology via Logic, volume 5 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.