Completeness of Finitely Weighted Kleene Algebra With Tests
arXiv:2407.07570 · doi:10.1007/978-3-031-62687-6_14
Abstract
Building on Ésik and Kuich's completeness result for finitely weighted Kleene algebra, we establish relational and language completeness results for finitely weighted Kleene algebra with tests. Similarly as Ésik and Kuich, we assume that the finite semiring of weights is commutative, partially ordered and zero-bounded, but we also assume that it is integral. We argue that finitely weighted Kleene algebra with tests is a natural framework for equational reasoning about weighted programs in cases where an upper bound on admissible weights is assumed.
Published version: I. Sedlár: Completeness of Finitely Weighted Kleene Algebra with Tests. In: G. Metcalfe, T. Studer, R. de Queiroz (Eds.): Logic, Language, Information, and Computation (WoLLIC 2024), pp. 210-224. Lecture Notes in Computer Science, vol 14672. Springer, Cham, 2024