Completeness of Finitely Weighted Kleene Algebra With Tests
Abstract
Building on \'Esik 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 \'Esik 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.
Cite
@article{arxiv.2407.07570,
title = {Completeness of Finitely Weighted Kleene Algebra With Tests},
author = {Igor Sedlár},
journal= {arXiv preprint arXiv:2407.07570},
year = {2024}
}
Comments
Published version: I. Sedl\'ar: 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