Bidirectional Nested Weighted Automata

Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input words only in the forward direction. It is natural to allow the automata to process input words backwards as well, for example, to measure the maximal or average time between a response and the preceding request. We therefore introduce and study bidirectional NWA that can process input words in both directions. First, we show that bidirectional NWA can express interesting quantitative properties that are not expressible by forward-only NWA. Second, for the fundamental decision problems of emptiness and universality, we establish decidability and complexity results for the new framework which match the best-known results for the special case of forward-only NWA. Thus, for NWA, the increased expressiveness of bidirectionality is achieved at no additional computational complexity. This is in stark contrast to the unweighted case, where bidirectional finite automata are no more expressive but exponentially more succinct than their forward-only counterparts.

[1]  M. Droste,et al.  Weighted automata and weighted logics on infinite words , 2010 .

[2]  Thomas Colcombet,et al.  Bounds in w-Regularity , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

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

[4]  Krishnendu Chatterjee,et al.  Quantitative Temporal Simulation and Refinement Distances for Timed Systems , 2015, IEEE Transactions on Automatic Control.

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

[6]  Cristian Riveros,et al.  Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties , 2016, STACS.

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

[8]  Kim G. Larsen,et al.  Average-energy games , 2015, Acta Informatica.

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

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

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

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

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

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

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

[16]  Cristian Riveros,et al.  Copyless cost-register automata: Structure, expressiveness, and closure properties , 2019, J. Comput. Syst. Sci..

[17]  Orna Kupferman,et al.  Formally Reasoning About Quality , 2016, J. ACM.

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

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

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

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

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