Quantitative Automata under Probabilistic Semantics

Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions, we establish that automata with monitor counters and nested weighted automata are equivalent. We study for the first time such quantitative automata under probabilistic semantics. We show that several problems that are undecidable for the classical questions of emptiness and universality become decidable under the probabilistic semantics. We present a complete picture of decidability for such automata, and even an almost-complete picture of computational complexity, for the probabilistic questions we consider.

[1]  Orna Kupferman,et al.  Discounting in LTL , 2014, TACAS.

[2]  Krishnendu Chatterjee,et al.  Nested Weighted Automata , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[3]  Krishnendu Chatterjee,et al.  Nested Weighted Limit-Average Automata of Bounded Width , 2016, MFCS.

[4]  Manfred Droste,et al.  Weighted automata and weighted logics on infinite words , 2006, Developments in Language Theory.

[5]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[6]  Krishnendu Chatterjee,et al.  MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives , 2015, TACAS.

[7]  Krishnendu Chatterjee,et al.  Markov Decision Processes with Multiple Long-Run Average Objectives , 2007, FSTTCS.

[8]  Krishnendu Chatterjee,et al.  Quantitative Automata under Probabilistic Semantics , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[9]  Christel Baier,et al.  Trade-off analysis meets probabilistic model checking , 2014, CSL-LICS.

[10]  Christel Baier,et al.  Weight monitoring with linear temporal logic: complexity and decidability , 2014, CSL-LICS.

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

[12]  Krishnendu Chatterjee,et al.  Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

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

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

[15]  Christel Baier,et al.  Principles of model checking , 2008 .

[16]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

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

[18]  Krishnendu Chatterjee,et al.  Measuring and Synthesizing Systems in Probabilistic Environments , 2010, J. ACM.

[19]  Krishnendu Chatterjee,et al.  Multi-objective Discounted Reward Verification in Graphs and MDPs , 2013, LPAR.

[20]  Hongyang Qu,et al.  Quantitative Multi-objective Verification for Probabilistic Systems , 2011, TACAS.

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

[22]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[23]  Krishnendu Chatterjee,et al.  Quantitative Monitor Automata , 2016, SAS.

[24]  Krishnendu Chatterjee,et al.  Temporal Specifications with Accumulative Values , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

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

[26]  Krishnendu Chatterjee,et al.  Energy and Mean-Payoff Parity Markov Decision Processes , 2011, MFCS.

[27]  Krishnendu Chatterjee,et al.  A Survey of Stochastic Games with Limsup and Liminf Objectives , 2009, ICALP.

[28]  Thomas A. Henzinger,et al.  Markov Decision Processes with Multiple Objectives , 2006, STACS.

[29]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[30]  Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes , 2015, LICS 2015.

[31]  M. Raj Mohan,et al.  Averaging in LTL , 2014, CONCUR.

[32]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.