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 Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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 metadatas

Cited literature [35 references]  Display  Hide  Download

https://hal.inria.fr/inria-00428998
Contributor : Olga Kouchnarenko <>
Submitted on : Friday, October 30, 2009 - 12:24:58 PM
Last modification on : Thursday, February 7, 2019 - 3:45:40 PM
Long-term archiving on : Thursday, June 17, 2010 - 6:47:56 PM

File

rp09_submission.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

445

Files downloads

157