How to Tackle Integer Weighted Automata Positivity
Résumé
This paper is dedicated to candidate abstractions to capture relevant aspects of the integer weighted automata. The expected effect of applying these abstractions is studied to build the deterministic reachability graphs allowing us to semi-decide the positivity problem on these automata. Moreover, the papers reports on the implementations and experimental results, and discusses other encodings.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...