How to Tackle Integer Weighted Automata Positivity

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.

[1]  Pierre-Cyrille Héam,et al.  A theoretical limit for safety verification techniques with regular fix-point computations , 2008, Inf. Process. Lett..

[2]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  S. Gaubert.  Performance evaluation of (max, +) automata , 1995, IEEE Trans. Autom. Control..

[4]  Fernando Pereira,et al.  Weighted finite-state transducers in speech recognition , 2002, Comput. Speech Lang..

[5]  Jérôme Leroux.  Structural Presburger digit vector automata , 2008, Theor. Comput. Sci..

[6]  S. Lombardy.  Sequentialization and Unambiguity of (Max,+) Rational Series Over One Letter , 2001 .

[7]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[8]  Thomas A. Henzinger,et al.  A classification of symbolic transition systems , 2000, TOCL.

[9]  David A. McAllester,et al.  Automated Deduction - CADE-17 , 2000, Lecture Notes in Computer Science.

[10]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[11]  Yohan Boichut,et al.  Rewriting Approximations for Fast Prototyping of Static Analyzers , 2007, RTA.

[12]  José Meseguer,et al.  Formal Analysis of Java Programs in JavaFAN , 2004, CAV.

[13]  Moshe Y. Vardi,et al.  Experimental Evaluation of Classical Automata Constructions , 2005, LPAR.

[14]  Andreas Weber.  Finite-Valued Distance Automata , 1994, Theor. Comput. Sci..

[15]  Thomas A. Henzinger,et al.  A Classification of Symbolic Transition Systems , 2000, STACS.

[16]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[17]  Parosh Aziz Abdulla,et al.  Minimal Cost Reachability/Coverability in Priced Timed Petri Nets , 2009, FoSSaCS.

[18]  Pierre Wolper,et al.  Representing Arithmetic Constraints with Finite Automata: An Overview , 2002, ICLP.

[19]  Seymour Ginsburg,et al.  BOUNDED REGULAR SETS , 1966 .

[20]  Ahmed Bouajjani,et al.  TReX: A Tool for Reachability Analysis of Complex Systems , 2001, CAV.

[21]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[22]  Daniel Kirsten,et al.  Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata , 2009, STACS.

[23]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[24]  Thomas Genet,et al.  Decidable Approximations of Sets of Descendants and Sets of Normal Forms , 1998, RTA.

[25]  Philippe Schnoebelen,et al.  A Short Visit to the STS Hierarchy , 2006, EXPRESS.

[26]  José Meseguer,et al.  Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools , 2004, IJCAR.

[27]  Daniel Krob,et al.  The Equality Problem for Rational Series with Multiplicities in the tropical Semiring is Undecidable , 1992, Int. J. Algebra Comput..

[28]  Karel Culik,et al.  Generalized Weighted Finite Automata Based Image Compression , 1999, J. Univers. Comput. Sci..

[29]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

[30]  Sophie Tison,et al.  Regular Tree Languages and Rewrite Systems , 1995, Fundam. Informaticae.

[31]  Véronique Bruyère,et al.  On the optimal reachability problem of weighted timed automata , 2007, Formal Methods Syst. Des..

[32]  Ines Klimann,et al.  Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton , 2004, Theor. Comput. Sci..

[33]  Thomas Genet,et al.  Rewriting for Cryptographic Protocol Verification , 2000, CADE.

[34]  Fernando Pereira,et al.  Weighted Automata in Text and Speech Processing , 2005, ArXiv.

[35]  Kim G. Larsen,et al.  Optimal reachability for multi-priced timed automata , 2008, Theor. Comput. Sci..

[36]  Pierre-Etienne Moreau,et al.  Towards an Efficient Implementation of Tree Automata Completion , 2008, AMAST.

[37]  Wolfgang Merzenich,et al.  Enhancements of partitioning techniques for image compression using weighted finite automata , 2004, Theor. Comput. Sci..

[38]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[39]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[40]  Shuji Jimbo,et al.  Decidability of The Equivalence Problem for Finitely Ambiguous Finance Automata , 2002, Int. J. Algebra Comput..

[41]  Alain Finkel,et al.  Reduction and covering of infinite reachability trees , 1990, Inf. Comput..

[42]  Laure Petrucci,et al.  FAST: acceleration from theory to practice , 2008, International Journal on Software Tools for Technology Transfer.

[43]  Olga Kouchnarenko,et al.  Finer Is Better: Abstraction Refinement for Rewriting Approximations , 2008, RTA.

[44]  Raffaele Giancarlo,et al.  An Approximate Determinization Algorithm for Weighted Finite-State Automata , 2001, Algorithmica.