Equational axioms of test algebra

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

Volumn 1414, Issue , 1998, Pages 295-310

  Hollenberg, Marco ^a  

^a CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84865412069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028021     Document Type: Conference Paper

References (17)

1. E. Cohen, D. Kozen and F. Smith. The complexity of Kleene algebra with tests. Technical Report 96-1598, Computer Science Department, Cornell University, July 1996.
2. J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.
3. M.J. Fisher and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.
4. R. Goldblatt. Logics of Time and Computation. 2nd edition, volume 7 of CSLI Lecture Notes. CSLI Publications, Stanford, 1992.
5. S.C. Kleene. Representation of events in nerve nets and finite automata. In Shannon and McCarthy, editors, Automata Studies, pages 3-41. Princeton University Press, 1956.
6. D. Kozen. On induction versus *-continuity. In D. Kozen, editor, Proceedings Workshop on Logics of Programs 1981, volume 131 of LNCS, pages 167-176, 181.
7. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regulax events. Information and Computation, 110:2:366-390, May 1994.
8. D. Kozen. Kleene algebra with tests. Transactions on Programming Languages and Systems, 427-443, May 1997.
9. D. Kozen and F. Smith. Kleene algebra with tests: completeness and decidability. Proc. 10th Int. Workshop on Computer Science Logic (CSL’96), ed. D. van Dalen and M. Bezem, Utrecht, The Netherlands, Springer-Verlag LNCS volume 1258, 244-259, September 1996.
10. D. Krob. A complete system of B-rational identities. Theoretical Computer Science, 89(2):207-343, October 1991.
11. I. Nemeti. Dynamic algebras of programs. In Proceedings Fundamentals of Computation Theory, volume 117 of LNCS, pages 281-290. Springer-Verlag, 1981.
12. V. Pratt. Semantical considerations on Floyd-Hoare logic. In Proceedings 17th IEEE Symposium on Foundations of Computer Science, pages 109-121, 1976.
13. V. Pratt. Dynamic algebras as a well-behaved fragment of relation algebras. In D. Pigozzi, editor, Proceedings Conference on Algebra and Computer Science, volume 425 of LNCS, pages 77-110. Springer, June 1988.
14. V. Pratt. Dynamic algebras: examples, constructions, applications. Studia Logica, 50:571-605, 1991.
15. V.N. Redko. On defining relations for the algebra of regular events. Ukrainskii Matematicheskii Zhurnal, 16:120-126, 1964. In Russian.
16. K. Segerberg. A completeness theorem in the modal logic of programs. In T. Traczyk, editor, Universal algebra and applications, volume 9 of Banach Centre Publications, pages 31-46. PWN-Polish Scientific Publishers, Warsaw, 1982.
17. V. Trnkova and J. Reiterman, Dynamic algebra with test. Journal of Computer and System Sciences, 35:229-242, 1987.