Completeness of Finitely Weighted Kleene Algebra with Tests

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F24%3A00586993" target="_blank" >RIV/67985807:_____/24:00586993 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/10.1007/978-3-031-62687-6_14" target="_blank" >https://doi.org/10.1007/978-3-031-62687-6_14</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-62687-6_14" target="_blank" >10.1007/978-3-031-62687-6_14</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Completeness of Finitely Weighted Kleene Algebra with Tests
Popis výsledku v původním jazyce
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.
Název v anglickém jazyce
Completeness of Finitely Weighted Kleene Algebra with Tests
Popis výsledku anglicky
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.

Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
<a href="/cs/project/GA22-16111S" target="_blank" >GA22-16111S: GRADLACT: Stupňované logiky konání</a><br>
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění
2024
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)