Nested Weighted Automata

Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time. In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.

[1]  Krishnendu Chatterjee,et al.  Nested Weighted Automata , 2015, LICS 2015.

[2]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[3]  Jean-François Raskin,et al.  Quantitative Languages Defined by Functional Automata , 2011, CONCUR.

[4]  Krishnendu Chatterjee,et al.  Temporal Specifications with Accumulative Values , 2011, LICS.

[5]  Rajeev Alur,et al.  Regular Functions and Cost Register Automata , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[6]  Hing Leung.  Limitedness Theorem on Finite Automata with Distance Functions: An Algebraic Proof , 1991, Theor. Comput. Sci..

[7]  Mehryar Mohri,et al.  Semiring Frameworks and Algorithms for Shortest-Distance Problems , 2002, J. Autom. Lang. Comb..

[8]  Dexter Kozen,et al.  Lower bounds for natural proof systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Krishnendu Chatterjee,et al.  Alternating Weighted Automata , 2009, FCT.

[10]  Swarat Chaudhuri,et al.  Software model checking using languages of nested trees , 2011, TOPL.

[11]  Szymon Torunczyk,et al.  Energy and Mean-Payoff Games with Imperfect Information , 2010, CSL.

[12]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[13]  Krishnendu Chatterjee,et al.  Probabilistic Weighted Automata , 2009, CONCUR.

[14]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[15]  T. Henzinger,et al.  Model measuring for discrete and hybrid systems , 2017 .

[16]  Krishnendu Chatterjee,et al.  Quantitative languages , 2008, TOCL.

[17]  Krishnendu Chatterjee,et al.  Mean-Payoff Automaton Expressions , 2010, CONCUR.

[18]  Amir Pnueli,et al.  On the Merits of Temporal Testers , 2008, 25 Years of Model Checking.

[19]  Swarat Chaudhuri,et al.  Languages of Nested Trees , 2006, CAV.

[20]  Christian Mathissen,et al.  Weighted Logics for Nested Words and Algebraic Formal Power Series , 2008, ICALP.

[21]  Krishnendu Chatterjee,et al.  Expressiveness and Closure Properties for Quantitative Languages , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[22]  Manfred Droste,et al.  Weighted automata and weighted MSO logics for average and long-time behaviors , 2012, Inf. Comput..

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

[24]  Orna Kupferman,et al.  What's Decidable about Weighted Automata? , 2011, ATVA.

[25]  R. Alur,et al.  Adding nesting structure to words , 2006, JACM.

[26]  Satoru Miyano,et al.  Alternating Finite Automata on omega-Words , 1984, CAAP.

[27]  Benedikt Bollig,et al.  Pebble Weighted Automata and Transitive Closure Logics , 2010, ICALP.

[28]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[29]  Thomas A. Henzinger,et al.  From Model Checking to Model Measuring , 2013, CONCUR.

[30]  Grigore Rosu,et al.  Synthesizing Monitors for Safety Properties , 2002, TACAS.

[31]  Krishnendu Chatterjee,et al.  Mean-Payoff Pushdown Games , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.