Skip to Main content Skip to Navigation
Conference papers

How to Tackle Integer Weighted Automata Positivity

Yohan Boichut 1 Pierre-Cyrille Heam 2, 3 Olga Kouchnarenko 2
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : 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.
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download
Contributor : Olga Kouchnarenko Connect in order to contact the contributor
Submitted on : Friday, October 30, 2009 - 12:24:58 PM
Last modification on : Saturday, October 16, 2021 - 11:26:06 AM
Long-term archiving on: : Thursday, June 17, 2010 - 6:47:56 PM


Files produced by the author(s)



Yohan Boichut, Pierre-Cyrille Heam, Olga Kouchnarenko. How to Tackle Integer Weighted Automata Positivity. 3rd InternationalWorkshop on Reachability Problems - RP 2009, Sep 2009, Palaiseau, France. pp.79-92, ⟨10.1007/978-3-642-04420-5_9⟩. ⟨inria-00428998⟩



Record views


Files downloads