How to Tackle Integer Weighted Automata Positivity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

How to Tackle Integer Weighted Automata Positivity

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.

Domains

Modeling and Simulation Software Engineering [cs.SE]
Fichier principal
Vignette du fichier
rp09_submission.pdf (839.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Olga Kouchnarenko  : Connect in order to contact the contributor

https://inria.hal.science/inria-00428998

Submitted on : Friday, October 30, 2009-12:24:58 PM

Last modification on : Monday, September 11, 2023-5:41:18 PM

Long-term archiving on: Thursday, June 17, 2010-6:47:56 PM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA UNIV-FCOMTE UNIV-BM UNIV-ORLEANS ENS-CACHAN FEMTO-ST UNIV-BM-THESE MSL MSL-THESE UNIV-LORRAINE INRIA2 TDS-MACS LORIA LORIA-FM ANR ENS-PARIS-SACLAY
206 View
87 Download

Altmetric

Share

Gmail Facebook X LinkedIn More