Skip to main content

Equational axioms of test algebra

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1414))

Included in the following conference series:

  • 145 Accesses

Abstract

We have axiomatized test algebra equations and achieved a finite equational axiomatization relative to Kleene algebra. The previous section showed that the Kleene algebra component cannot be replaced by a finite set of test algebra equations.

There is thus a tradeoff: on the one hand we have a sound and complete axiomatization using an infinite number of equations (this paper), on the other we have a finite axiomatization that uses a П 20 -axiom ([17]). However, if we replace the Kleene algebra component of the test calculus with any theory that is sound in test algebra and implies all the valid Kleene algebra equations, we get another sound and complete theory. One such theory is presented in [7]. This theory consists of a finite number of equations and two quasi-equations: abba*bb babba* ≤ b where xy abbreviates x + y = y (this theory is also used in [9] to define Kleene algebas). Thus, a finite axiomatization is possible with a purely П 01 -theory, in fact only quasi-equations are necessary. We do not need to reprove the completeness theorem: it is a simple matter of combining the theorem of this paper and that of [7].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. J.H. Conway. Regular Algebra and Finite Machines. Chapman and Hall, London, 1971.

    Google Scholar 

  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.

    Article  Google Scholar 

  4. R. Goldblatt. Logics of Time and Computation. 2nd edition, volume 7 of CSLI Lecture Notes. CSLI Publications, Stanford, 1992.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  7. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110:2:366–390, May 1994.

    Article  Google Scholar 

  8. D. Kozen. Kleene algebra with tests. Transactions on Programming Languages and Systems, 427–443, May 1997.

    Google Scholar 

  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.

    Google Scholar 

  10. D. Krob. A complete system of B-rational identities. Theoretical Computer Science, 89(2):207–343, October 1991.

    Article  Google Scholar 

  11. I. Németi. Dynamic algebras of programs. In Proceedings Fundamentals of Computation Theory, volume 117 of LNCS, pages 281–290. Springer-Verlag, 1981.

    Google Scholar 

  12. V. Pratt. Semantical considerations on Floyd-Hoare logic. In Proceedings 17th IEEE Symposium on Foundations of Computer Science, pages 109–121, 1976.

    Google Scholar 

  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.

    Google Scholar 

  14. V. Pratt. Dynamic algebras: examples, constructions, applications. Studia Logica, 50:571–605, 1991.

    Article  Google Scholar 

  15. V.N. Redko. On defining relations for the algebra of regular events. Ukrainskii Matematicheskii Zhurnal, 16:120–126, 1964. In Russian.

    Google Scholar 

  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.

    Google Scholar 

  17. V. Trnková and J. Reiterman. Dynamic algebra with test. Journal of Computer and System Sciences, 35:229–242, 1987.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mogens Nielsen Wolfgang Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hollenberg, M. (1998). Equational axioms of test algebra. In: Nielsen, M., Thomas, W. (eds) Computer Science Logic. CSL 1997. Lecture Notes in Computer Science, vol 1414. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028021

Download citation

  • DOI: https://doi.org/10.1007/BFb0028021

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64570-2

  • Online ISBN: 978-3-540-69353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics