How to Tackle Integer Weighted Automata Positivity - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

How to Tackle Integer Weighted Automata Positivity

(1) , (2, 3) , (2)
1
2
3

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.
Fichier principal
Vignette du fichier
rp09_submission.pdf (839.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00428998 , version 1 (30-10-2009)

Identifiers

Cite

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⟩
191 View
77 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More