Completeness of Finitely Weighted Kleene Algebra With Tests
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916318664458240 |
|---|---|
| author | Sedlár, Igor |
| author_facet | Sedlár, Igor |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_07570 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Completeness of Finitely Weighted Kleene Algebra With Tests Sedlár, Igor Logic in Computer Science 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. |
| title | Completeness of Finitely Weighted Kleene Algebra With Tests |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2407.07570 |