On kleene algebras for weighted computation
Kleene algebra with tests (KAT) was introduced as an alge- braic structure to model and reason about classic imperative programs, i.e. sequences of discrete actions guarded by Boolean tests. This paper introduces two generalisations of this structure able to ex- press programs as weighted transition...
Autor principal: | |
---|---|
Outros Autores: | , |
Formato: | conferencePaper |
Idioma: | eng |
Publicado em: |
2017
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/1822/69296 |
País: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/69296 |