Generalising KAT to verify weighted computations
Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of this structure able to express programs as weighted transition...
Autor principal: | |
---|---|
Outros Autores: | , |
Formato: | article |
Idioma: | eng |
Publicado em: |
2019
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/1822/69188 |
País: | Portugal |
Oai: | oai:repositorium.sdum.uminho.pt:1822/69188 |