Generic composition

Formal Aspects of Computing

Volumn 14, Issue 2, 2003, Pages 108-122

  Chen, Yifeng ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Healthiness condition; Modal logic; Parallelism; Predicative semantics

Indexed keywords

ALGEBRA; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

GENERIC COMPOSITION; HEALTHINESS CONDITION; MODAL LOGIC; PARALLELISM; PREDICATIVE SEMANTICS;

SEMANTICS;

EID: 0142075140     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001650200031     Document Type: Article

References (24)

1. [Abr99] Abramsky, A.: Semantics of Interaction: An Introduction to Game Semantics, pages 1-31. Cambridge University Press, 1999.
2. [AlS85] Alpern, B. and Schneider, F. B.: Defining liveness. Information Processing Letters, 21(4):181-185, 1985.
3. [BaS89] Back, R. J. R. and Sere, K.: Stepwise refinement of action systems. In Mathematics of Program Construction, LNCS 375, pages 115-138, Springer, 1989.
4. [Che80] Chellas, B. F.: Modal Logic, An Introduction. Cambridge University Press, 1980.
5. [Che00] Chen, Y.: How to write a healthiness condition. In Second International Conference on Integrated Formal Methods, LNCS 1945, pages 299-317. Springer, 2000.
6. [Che01] Chen, Y.: Formal Methods for Global Synchrony. PhD thesis, Oxford University Computing Laboratory, 2001.
7. [ChL02] Chen, Y. and Liu, Z.: Unifying temporal logics. Technical Report 09, Department of Maths and Computer Science, University of Leicester, 2002.
8. [Dij75] Dijkstra, E. W.: Guarded commands, nondeterminacy and the formal derivation of programs. Communications of the ACM, 18(8):453-457, 1975.
9. [Fin74] Fine, K.: An incomplete logic containing s4. Theoria, 40:23-29, 1974.
10. [Heh84] Hehner, E. C. R.: Predicative programming I, II. Communications of ACM, 27(2): 134-151, 1984.
11. [HoH86] Hoare, C. A. R. and He, J.: Weakest prespeciflcations, I, II. Fundamenta Informatica, 9:51-84, 217-252, 1986.
12. [HoH98] Hoare, C. A. R. and He, J.: Unifying Theories of Programming. Prentice Hall, 1998.
13. [Hoa85a] Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall, 1985.
14. [Hoa85b] Hoare, C. A. R.: Programs are Predicates, pages 141-155. Prentice-Hall, 1985.
15. [HSM97] He, J., Seidel, K. and McIver, A. K.: Probabilistic models for the guarded command language. Science of Computer Programming, 28(2):171-192, 1997.
16. [JoT51] J'onsson, B. and Tarski, A.: Boolean algebras with operators, Part I. American Journal of Mathematics, 73:891-939, 1951.
17. [Kar98] Karger, B. V.; Temporal algebra. Mathematical Structures in Computer Science, 8(3):277-320, 1998.
18. [Kri63] Kripke, S.: Semantical considerations on modal logic. Acta Philosophica Fennica, 16:83-94, 1963.
19. [Lam94] Lamport, L.: A temporal logic of actions. ACM Tramerions on Programming Languages and Systems, 16(3):872-923, 1994.
20. [Mad96] Maddux, R. D.: Relation-algebraic semantics. Theoretical Computer Science, 160:1-85, 1996.
21. [Mil89] Milner, R.: Communication and Concurrency. Prentice Hall, 1989.
22. [Pnu77] Pnueli, A.: The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 46-57. IEEE Computer Society Press, 1977.
23. [Tar41] Tarski, A.: On the calculus of relations. Journal of Symbolic Logic, 6(3):73-89, 1941.
24. [Val90] Valiant, L. G.: A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.