Weighted versus Probabilistic Logics

While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other quantitative extensions such as probabilistic CTL. We establish expressiveness results on our logics giving translations from weighted and probabilistic CTL into weighted MSO.

[1]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

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

[3]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[4]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[5]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[6]  Christel Baier,et al.  Recognizing /spl omega/-regular languages with probabilistic automata , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[7]  Holger Hermanns,et al.  Discrete-time rewards model-checked (to appear) , 2003 .

[8]  Jarkko Kari,et al.  Image Compression Using Weighted Finite Automata , 1993, MFCS.

[9]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[10]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[11]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[12]  Manfred Droste,et al.  Weighted tree automata and weighted logics , 2006, Theor. Comput. Sci..

[13]  Jason Eisner.  Expectation Semirings: Flexible EM for Learning Finite-State Transducers , 2001 .

[14]  Manfred Droste,et al.  Weighted automata and weighted logics with discounting , 2007, Theor. Comput. Sci..

[15]  Naveen Garg,et al.  FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings , 2006, FSTTCS.

[16]  Arto Salomaa,et al.  Semirings, Automata and Languages , 1985 .

[17]  Roberto Segala.  Probability and Nondeterminism in Operational Models of Concurrency , 2006, CONCUR.

[18]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[19]  Lukasz Kaiser,et al.  Model Checking Games for the Quantitative μ-Calculus , 2008, Theory of Computing Systems.

[20]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

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

[22]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[23]  Christel Baier,et al.  On Reduction Criteria for Probabilistic Reward Models , 2006, FSTTCS.

[24]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[25]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[26]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[27]  Paul Gastin,et al.  Weighted automata and weighted logics , 2005, Theor. Comput. Sci..

[28]  Christel Baier,et al.  Validation of Stochastic Systems , 2004, Lecture Notes in Computer Science.

[29]  Joost-Pieter Katoen,et al.  Discrete-Time Rewards Model-Checked , 2003, FORMATS.

[30]  Frank Ciesinski,et al.  On Probabilistic Computation Tree Logic , 2004, Validation of Stochastic Systems.

[31]  L. D. Alfaro.  The Verification of Probabilistic Systems Under Memoryless Partial-Information Policies is Hard , 1999 .

[32]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[33]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[34]  Peter Buchholz,et al.  Model Checking for a Class of Weighted Automata , 2003, Discret. Event Dyn. Syst..

[35]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[36]  Benedikt Bollig,et al.  Verifying Qualitative Properties of Probabilistic Programs , 2004, Validation of Stochastic Systems.

[37]  R. McNaughton.  Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order Arithmetic , 1963, Journal of Symbolic Logic.

[38]  U. Rieder,et al.  Markov Decision Processes , 2010 .

[39]  K. Knopp.  Theory and Application of Infinite Series , 1990 .

[40]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[41]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[42]  Christel Baier,et al.  On Decision Problems for Probabilistic Büchi Automata , 2008, FoSSaCS.

[43]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[44]  Ingmar Meinecke,et al.  A Weighted µ-Calculus on Words , 2009, Developments in Language Theory.

[45]  Alexander Meduna,et al.  Automata and Languages , 2000, Springer London.

[46]  Stephan Merz,et al.  Model Checking , 2000 .

[47]  Azaria Paz,et al.  Probabilistic automata , 2003 .

[48]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.