Non-termination in idempotent semirings

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

Volumn 4988 LNCS, Issue , 2008, Pages 206-220

  Höfner, Peter ^a   Struth, Georg ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

IDEMPOTENT SEMIRINGS; NON TERMINATIONS;

ITERATIVE METHODS;

EID: 46049105992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78913-0_16     Document Type: Conference Paper

References (16)

1. Arden, D.: Delayed logic and finite state machines. In: Theory of Computing Machine Design, pp. 1-35. University of Michigan Press (1960)
2. Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45-59. Springer, Heidelberg (2000)
3. Desharnais, J., Möller, B., Struth, G.: Termination in modal Kleene algebra. In: Lévy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) IFIP TCS 2004, pp. 647-660. Kluwer, Dordrecht (2004): Revised version: Algebraic Notions of Termination. Technical Report 2006-23, Institut für Informatik, Universität Augsburg (2006)
4. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM Trans. Computational Logic 7(4), 798-833 (2006)
5. ésik, Z., Kuich, W.: A semiring-semimodule generalization of ?-context-free languages. In: Karhumäki, J., Maurer, H., P?aun, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 68-80. Springer, Heidelberg (2004)
6. Goldblatt, R.: An algebraic study of well-foundedness. Studia Logica 44(4), 423-437 (1985)
7. Höfner, P., Struth, G.: January 14 (2008), http://www.dcs.shef.ac. uk/~georg/ka
8. Höfner, P., Struth, G.: Automated reasoning in Kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 279-294. Springer, Heidelberg (2007)
9. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110(2), 366-390 (1994)
10. McCune, W.: Prover9 and Mace4, January 14 (2008), http://www.cs.unm.edu/ ~mccune/prover9
11. Möller, B.: Kleene getting lazy. Sci. Comput. Programming 65, 195-214 (2007)
12. Möller, B., Struth, G.: Algebras of modal operators and partial correctness. Theoretical Computer Science 351(2), 221-239 (2006)
13. Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167-183. Springer, Heidelberg (1981)
14. Pratt, V.: Dynamic algebras: Examples, constructions, applications. Studia Logica 50, 571-605 (1991)
15. Struth, G.: Reasoning automatically about termination and refinement. In: Ranise, S. (ed.) InternationalWorkshop on First-Order Theorem Proving, Technical Report ULCS-07-018, Department of Computer Science, University of Liverpool, pp. 36-51 (2007)
16. von Wright, J.: Towards a refinement algebra. Science of Computer Programming 51(1-2), 23-45 (2004)