Termination in Modal Kleene algebra

IFIP Advances in Information and Communication Technology

Volumn 155, Issue , 2004, Pages 647-660

  Desharnais, Jules ^a   Möller, Bernhard ^b   Struth, Georg ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS;

FORWARD-AND-BACKWARD; KLEENE ALGEBRAS; MODAL OPERATORS; REWRITING THEORY; STATE TRANSITION SYSTEMS; TERMINATION ANALYSIS;

ALGEBRA;

EID: 84901046297     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8141-3_49     Document Type: Conference Paper

References (17)

1. F. Baader, T. Nipkow. Term rewriting and all that. Cambridge University Press 1998.
2. L. Bachmair, N. Dershowitz. Commutation, transformation, and termination. In J.H. Siekmann (ed.), 8th International Conference on Automated Deduction. LNCS 230. Springer 1986, 5-20.
3. B.F. Chellas. Modal Logic: An Introduction. Cambridge University Press 1980.
4. E. Cohen. Separation and reduction. In R. Backhouse, J.N. Oliveira (eds.), Proc. Mathematics of Program Construction, 5th International Conference, MPC 2000. LNCS 1887. Springer 2000, 45-59.
5. J.H. Conway. Regular Algebra and Finite State Machines. Chapman & Hall 1971.
6. J. Desharnais, B. Möller, G. Struth. Kleene algebra with domain. Technical Report 2003-07, Universität Augsburg, Institut für Informatik, June 2003.
7. J. Desharnais, B. Möller, G. Struth. Termination in modal Kleene algebra. Technical Report 2004-04, Universität Augsburg, Institut für Informatik, January 2004.
8. H. Doornbos, R. Backhouse, J. van der Woude. A calculational approach to mathematical induction. Theoretical Computer Science, 179:103-135 (1997).
9. A. Geser. Relative termination. PhD thesis, Fakultät fur Mathematik und Informatik, Universität Passau 1990.
10. R. Goldblatt., An algebraic study of well-foundedness. Studia Logica, 44(4):422-437 (1985).
11. D. Harel, D. Kozen, J. Tiuryn. Dynamic Logic. MIT Press 2000.
12. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366-390 (1994).
13. D. Kozen. Kleene algebra with tests. Trans. Programming Languages and Systems, 19(3):427-443 (1997).
14. G. Schmidt, T. Ströhlein. Relations and Graphs. EATCS Monographs in Computer Science. Springer 1993.
15. G. Struth. Non-symmetric rewriting. Technical Report MPI-I-96-2-004, Max-Planck-Institut für Informatik Saarbrücken 1996.
16. G. Struth. Calculating Church-Rosser proofs in Kleene algebra. In H.C.M. de Swart (ed.), Relational Methods in Computer Science, 6th International Conference. LNCS 2561. Springer 2002, 276-290.
17. G. Struth. An algebraic study of commutation and termination. Technical Report 2003-18, Institut für Informatik, Universität Augsburg, December 2003.