Temporal algebra

Mathematical Structures in Computer Science

Volumn 8, Issue 3, 1998, Pages 277-320

  Karger, Burghard Von ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84968421591     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0960129598002540     Document Type: Article

References (23)

1. Aarts, C. J. (1992) Galois connections presented calculationally. Eindhoven University of Technology. Available at ftp.win.tuein/pub/math.prog.construction/galois.dvi.Z.
2. Backhouse, R. C., Aarts, C. J., Hoogendijk, P., Voermans, E. and van der Woude, J. (1992) A relational theory of datatypes. Manuscript, Eindhoven University of Technology.
3. Backhouse, R. C., van den Eijnde, J. and van Gasteren, A. J. M. (1994) Calculating path algorithms. Science of Computer Programming.
4. Clarke, E. M. and Emerson, E. A. (1981) Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc. Workshop on Logics of Programs. Springer-Verlag Lecture Notes in Computer Science 131 52–71.
5. Emerson, E. A. (1990) Temporal and modal logic. In: van Leeuwen, J. (ed.) Formal Models and Semantics. Handbook of Theoretical Computer Science Volume B, Chapter 16, Elsevier 995–1072.
6. Everett, C. J. (1944) Closure operators and Galois theory in lattices. Trans. Amer. Math. Soc. 55 514–525.
7. van Gasteren, A. J. M. (1991) On the Shape of Mathematical Argument. Springer-Verlag Lecture Notes in Computer Science 445.
8. Herrlich, H. and Hugek M. (1985) Galois connections. Proceedings of MFPS. Springer-Verlag Lecture Notes in Computer Science 239 122–134.
9. Hoare, C. A. R. and He Jifeng (1985) The weakest prespecification. Technical Report PRG-44, Oxford University.
10. Hoare, C. A. R. and von Karger, B. (1995) Sequential calculus. Information Processing Letters 53 (3) 123–130.
11. von Karger, B. (1997). Sequential calculus. (In preparation, preliminary version available at http://informatik.uni-kiel.de/~bvk/)
12. von Karger, B. and Berghammer, R. (1996) A relational model for temporal logic. (Accepted for Publication in the Bulletin of the IGPL, available at www.informatik.uni-kiel.de/~bvk/.)
13. Manna, Z. and Pnueli, A. (1991) The Temporal Logic of Reactive and Concurrent Systems - Specifi-cation, Springer-Verlag.
14. Melton, A., Schmidt, D. A. and Strecker, G. E. (1986) Galois connections and computer science applications. In: Pitt, D., Abramsky, S., Poigne, A. and Rydeheard, D. (eds.) Category Theory and Computer Programming. Springer-Verlag Lecture Notes in Computer Science 240 299–312.
15. Melton, A., Schroder, B. S. W. and Strecker, G. E. (1994) Lagois connections - a counterpart to Galois connections. Theoretical Computer Science 136 (1) 79–108.
16. Moller, B. (1991) Relations as a program development language. Proc. IFIP TC2 Conference, North Holland.
17. Olderog, E. R. and Hoare, C. A. R. (1986) Specification oriented semantics for communicating processes. Acta Inf. 23 9–66.
18. Ore, O. (1944) Galois connexions. Trans. Amer. Math. Soc. 55 493–513.
19. Rasiowa, H. and Sikorski, R. (1963) Mathematics of Metamathematics, Polish Scientific Publishers, Warsaw
20. Scott, D. (1982) Domains for denotational semantics. ICALP ’82. Springer-Verlag Lecture Notes in Computer Science 140 577–613.
21. Stirling, C. (1992) Modal and temporal logics. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Background: Computational Structures. Handbook of Logic in Computer Science Volume 2, Clarendon Press 478–551.
22. Tarski, A. and Jonsson, B. (1951/52) Boolean algebras with operators, Parts I—II. Amer. J. Math. 73 891–939, 74 127–162.
23. Vickers, S. (1988) Topology via Logic, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press.