Weighted versus probabilistic logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5583 LNCS, Issue , 2009, Pages 18-38

  Bollig, Benedikt ^a   Gastin, Paul ^a  

^a INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL LOGIC; VERIFICATION ALGORITHMS; WEIGHTED AUTOMATA;

AUTOMATA THEORY; LINGUISTICS; TEMPORAL LOGIC; TRANSLATION (LANGUAGES);

PROBABILISTIC LOGICS;

EID: 69049088953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02737-6_2     Document Type: Conference Paper

References (37)

1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183-235 (1994)
2. Andova, S., Hermanns, H., Katoen, J.P.: Discrete-time rewards model-checked. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791, pp. 88-104. Springer, Heidelberg (2004)
3. Baier, C., Bertrand, N., Größer, M.: On decision problems for probabilistic Büchi automata. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 287-301. Springer, Heidelberg (2008)
4. Baier, C., Größer, M.: Recognizing ω-regular languages with probabilistic automata. In: Proceedings of LICS 2005, pp. 137-146. IEEE Computer Society Press, Los Alamitos (2005)
5. Bollig, B., Leucker, M.: Verifying qualitative properties of probabilistic programs. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 124-146. Springer, Heidelberg (2004)
6. Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 33-47. Springer, Heidelberg (2008)
7. Buchholz, P., Kemper, P.: Model checking for a class of weighted automata. Discrete Event Dynamic Systems (to appear, 2009)
8. Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6, 66-92 (1960)
9. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. of the International Congress on Logic, Methodology and Philosophy, pp. 1-11. Standford University Press (1962)
10. Ciesinski, F., Größer, M.: On probabilistic computation tree logic. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 147-188. Springer, Heidelberg (2004)
11. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52-71. Springer, Heidelberg (1982)
12. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)
13. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857-907 (1995)
14. Culik, K., Kari, J.: Image compression using weighted finite automata. Computer and Graphics 17(3), 305-313 (1993)
15. de Alfaro, L.: Formal verification of probabilistic systems. Technical report, Stanford University, PhD thesis (1998)
16. Droste, M., Gastin, P.: Weighted automata and weighted logics. Theoretical Computer Science 380(1-2), 69-86 (2007); Special issue of ICALP 2005
17. Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Kuich, W., Vogler, H., Droste, M. (eds.) Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (to appear, 2009)
18. Droste, M., Rahonis, G.: Weighted automata and weighted logics with discounting. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 73-84. Springer, Heidelberg (2007)
19. Droste, M., Vogler, H.: Weighted tree automata and weighted logics. Theoretical Computer Science 366(3), 228-247 (2006)
20. Eisner, J.: Expectation semirings: Flexible EM for learning finite-state transducers. In: Proceedings of the ESSLLI workshop on finite-state methods in NLP (2001)
21. Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21-52 (1961)
22. Fischer, D., Grädel, E., Kaiser, L.: Model checking games for the quantitative μ-calculus. Theory of Computing Systems (2009); Special Issue of STACS 2008
23. Größer, M., Norman, G., Baier, C., Ciesinski, F., Kwiatkowska, M., Parker, D.: On reduction criteria for probabilistic reward models. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 309-320. Springer, Heidelberg (2006)
24. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6(5), 512-535 (1994)
25. Knopp, K.: Theory and Application of Infinite Series. Dover Publications, New York (1990); Republication of the second English edn. (1951)
26. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333-354 (1983)
27. Kuich, W., Salomaa, A.: Semirings, Automata and Languages. Springer, Heidelberg (1985)
28. Kuich, W., Vogler, H., Droste, M. (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2009)
29. Meinecke, I.: A weighted μ-calculus on words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583. Springer, Heidelberg (2009)
30. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269-311 (1997)
31. Pnueli, A.: The temporal logic of programs. In: Proceedings of FOCS 1977, pp. 46-57. IEEE Computer Society Press, Los Alamitos (1977)
32. Puterman, M.L.: Markov Decision Processes. John Wiley & Sons, Inc., New York (1994)
33. Rabin, M.O.: Probabilistic automata. Information and Control 6, 230-245 (1963)
34. Segala, R.: Probability and nondeterminism in operational models of concurrency. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 64-78. Springer, Heidelberg (2006)
35. Thomas, W.: Languages, automata and logic. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 389-455. Springer, Heidelberg (1997)
36. van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Information and Computation 121(1), 59-80 (1995)
37. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings of FOCS 1985, pp. 327-338. IEEE, Los Alamitos (1985)