References

  1. P. A. Abdulla, C. Baier, S. Purushothaman Iyer & B. Jonsson (2005): Simulating Perfect Channels with Probabilistic Lossy Channels. Information and Computation 197(1–2), pp. 22–40, doi:10.1016/j.ic.2004.12.001.
  2. P. A. Abdulla, N. Ben Henda, L. de Alfaro, R. Mayr & S. Sandberg (2008): Stochastic Games with Lossy Channels. In: Proc. 11th Int. Conf. Foundations of Software Science and Computational Structures (FOSSACS 2008), Lecture Notes in Computer Science 4962. Springer, pp. 35–49, doi:10.1007/978-3-540-78499-9_4.
  3. P. A. Abdulla, N. Bertrand, A. Rabinovich & Ph Schnoebelen (2005): Verification of Probabilistic Systems with Faulty Communication. Information and Computation 202(2), pp. 141–165, doi:10.1016/j.ic.2005.05.008.
  4. P. A. Abdulla, J. Deneux, J. Ouaknine & J. Worrell (2005): Decidability and complexity results for timed automata via channel machines. In: Proc. 32nd Int. Coll. Automata, Languages, and Programming (ICALP 2005), Lecture Notes in Computer Science 3580. Springer, pp. 1089–1101, doi:10.1007/11523468_88.
  5. A. Arnold & D. Niwiński (2001): Rudiments of μ-Calculus. Studies in Logic and the Foundations of Mathematics 146. Elsevier Science, doi:10.1016/S0049-237X(01)80001-X.
  6. C. Baier, N. Bertrand & Ph. Schnoebelen (2006): A note on the attractor-property of infinite-state Markov chains. Information Processing Letters 97(2), pp. 58–63, doi:10.1016/j.ipl.2005.09.011.
  7. C. Baier, N. Bertrand & Ph. Schnoebelen (2006): On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. In: Proc. 13th Int. Conf. on Logic for Programming and Artificial Intelligence, and Reasoning (LPAR 2006), Lecture Notes in Computer Science 4246. Springer, pp. 347–361, doi:10.1007/11916277_24.
  8. C. Baier, N. Bertrand & Ph. Schnoebelen (2007): Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Transactions on Computational Logic 9(1), doi:10.1145/1297658.1297663.
  9. C. Baier, T. Brázdil, M. Größer & A. Kucera (2012): Stochastic game logic. Acta Informatica 49(4), pp. 203–224, doi:10.1007/s00236-012-0156-0.
  10. C. Baier & B. Engelen (1999): Establishing Qualitative Properties for Probabilistic Lossy Channel Systems: An Algorithmic Approach. In: Proc. 5th AMAST Workshop Formal Methods for Real-Time and Probabilistic Systems (ARTS 1999), Lecture Notes in Computer Science 1601. Springer, pp. 34–52, doi:10.1007/3-540-48778-6_3.
  11. P. Barceló, D. Figueira & L. Libkin (2012): Graph Logics with Rational Relations and the Generalized Intersection Problem. In: Proc. 27th IEEE Symp. Logic in Computer Science (LICS 2012). IEEE Comp. Soc. Press, pp. 115–124, doi:10.1109/LICS.2012.23.
  12. N. Bertrand & Ph. Schnoebelen (2012): Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design, doi:10.1007/s10703-012-0168-y. To appear. Long version of BBS-lpar.
  13. A. Bouajjani, B. Jonsson, M. Nilsson & T. Touili (2000): Regular Model Checking. In: Proc. 12th Int. Conf. Computer Aided Verification (CAV 2000), Lecture Notes in Computer Science 1855. Springer, pp. 403–418, doi:10.1007/10722167_31.
  14. P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen & J. Worrell (2008): On Termination for Faulty Channel Machines. In: Proc. 25th Ann. Symp. Theoretical Aspects of Computer Science (STACS 2008), Leibniz Int. Proc. in Informatics 1. Leibniz-Zentrum für Informatik, pp. 121–132, doi:10.4230/LIPIcs.STACS.2008.1339.
  15. P. Bouyer, N. Markey & P.-A. Reynier (2008): Robust Analysis of Timed Automata via Channel Machines. In: Proc. 11th Int. Conf. Foundations of Software Science and Computational Structures (FOSSACS 2008), Lecture Notes in Computer Science 4962. Springer, pp. 157–171, doi:10.1007/978-3-540-78499-9_12.
  16. J. Bradfield & C. Stirling (2007): Modal mu-calculi. In: P. Blackburn, J. Van Benthem & F. Wolter: Handbook of Modal Logic, chapter 12, Studies in Logic and Practical Reasoning 3. Elsevier Science, pp. 721–756, doi:10.1016/S1570-2464(07)80015-2.
  17. T. Brázdil, V. Brozek & K. Etessami (2010): One-Counter Stochastic Games. In: Proc. 30th Conf. Found. of Software Technology and Theor. Comp. Sci. (FST&TCS 2010), Leibniz Int. Proc. in Informatics 8. Leibniz-Zentrum für Informatik, pp. 108–119, doi:10.4230/LIPIcs.FSTTCS.2010.108.
  18. T. Brázdil, V. Brozek, K. Etessami & A. Kučera (2011): Approximating the Termination Value of One-Counter MDPs and Stochastic Games. In: Proc. 38th Int. Coll. Automata, Languages and Programming (ICALP 2011), Lecture Notes in Computer Science 6756. Springer, pp. 332–343, doi:10.1007/978-3-642-22012-8_26.
  19. T. Brázdil, V. Brozek, A. Kučera & J. Obdrzálek (2011): Qualitative reachability in stochastic BPA games. Information & Computation 209(8), pp. 1160–1183, doi:10.1016/j.ic.2011.02.002.
  20. T. Brázdil, A. Kučera & P. Novotný (2013): Determinacy in Stochastic Games with Unbounded Payoff Functions. In: Proc. 8th Int. Workshop Mathematical and Engineering Methods in Computer Science (MEMICS 2012), Lecture Notes in Computer Science 7721. Springer, pp. 94–105, doi:10.1007/978-3-642-36046-6_10.
  21. P. Chambart & Ph. Schnoebelen (2008): The Ordinal Recursive Complexity of Lossy Channel Systems. In: Proc. 23rd IEEE Symp. Logic in Computer Science (LICS 2008). IEEE Comp. Soc. Press, pp. 205–216, doi:10.1109/LICS.2008.47.
  22. K. Chatterjee, L. de Alfaro & T. A. Henzinger (2004): Trading Memory for Randomness. In: Proc. 1st Int. Conf. Quantitative Evaluation of Systems (QEST 2004). IEEE Comp. Soc. Press, pp. 206–217, doi:10.1109/QEST.2004.10051.
  23. K. Chatterjee, M. Jurdzinski & T. A. Henzinger (2003): Simple Stochastic Parity Games. In: Proc. 17th Int. Workshop Computer Science Logic (CSL 2003) and 8th Kurt Gödel Coll. (KGL 2003), Lecture Notes in Computer Science 2803. Springer, pp. 100–113, doi:10.1007/978-3-540-45220-1_11.
  24. Taolue Chen & Jian Lu (2007): Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm. In: Proc. 4th Int. Conf. Fuzzy Systems and Knowledge Discovery (FSKD 2007), Aug. 2007, Haikou, Hainan, China. IEEE Comp. Soc. Press, pp. 35–39, doi:10.1109/FSKD.2007.458.
  25. A. Condon (1992): The Complexity of Stochastic Games. Information and Computation 96(2), pp. 203–224, doi:10.1016/0890-5401(92)90048-K.
  26. K. Etessami & M. Yannakakis (2008): Recursive Concurrent Stochastic Games. Logical Methods in Computer Science 4(4), doi:10.2168/LMCS-4(4:7)2008.
  27. P. Jančar, P. Karandikar & Ph. Schnoebelen (2012): Unidirectional channel systems can be tested. In: Proc. 7th IFIP Int. Conf. on Theoretical Computer Science (IFIP TCS 2012), Lecture Notes in Computer Science 7604. Springer, pp. 149–163, doi:10.1007/978-3-642-33475-7_11.
  28. P. Karandikar & S. Schmitz (2013): The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. In: Proc. 16th Int. Conf. Foundations of Software Science and Computational Structures (FOSSACS 2013), Lecture Notes in Computer Science 7794. Springer, pp. 273–288, doi:10.1007/978-3-642-37075-5_18.
  29. Y. Kesten, O. Maler, M. Marcus, A. Pnueli & E. Shahar (2001): Symbolic model checking with rich assertional languages. Theoretical Computer Science 256(1–2), pp. 93–112, doi:10.1016/S0304-3975(00)00103-1.
  30. B. Konev, F. Wolter & M. Zakharyaschev (2005): Temporal logics over transitive states. In: Proc. 20th Conf. Automated Deduction (CADE 2005), Lecture Notes in Computer Science 3632. Springer, pp. 182–203, doi:10.1007/11532231_14.
  31. E. V. Kouzmin, N. V. Shilov & V. A. Sokolov (2004): Model Checking mu-Calculus in Well-Structured Transition Systems. In: Proc. 11th Int. Symp. Temporal Representation and Reasoning (TIME 2004). IEEE Comp. Soc. Press, pp. 152–155, doi:10.1109/TIME.2004.1314433.
  32. D. A. Martin (1998): The determinacy of Blackwell Games. The Journal of Symbolic Logic 63(4), pp. 1565–1581, doi:10.2307/2586667.
  33. A. Muscholl (2010): Analysis of Communicating Automata. In: Proc. 4th Int. Conf. Language and Automata Theory and Applications (LATA 2010), Lecture Notes in Computer Science 6031. Springer, pp. 50–57, doi:10.1007/978-3-642-13089-2_4.
  34. S. Purushothaman Iyer & M. Narasimha (1997): Probabilistic Lossy Channel Systems. In: Proc. 7th Int. Joint Conf. Theory and Practice of Software Development (TAPSOFT '97), Lecture Notes in Computer Science 1214. Springer, pp. 667–681, doi:10.1007/BFb0030633.
  35. M. L. Puterman (1994): Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons, doi:10.1002/9780470316887.
  36. A. Rabinovich (2006): Quantitative analysis of probabilistic lossy channel systems. Information and Computation 204(5), pp. 713–740, doi:10.1016/j.ic.2005.11.004.
  37. S. Schmitz & Ph. Schnoebelen (2011): Multiply-Recursive Upper Bounds with Higman's Lemma. In: Proc. 38th Int. Coll. Automata, Languages, and Programming (ICALP 2011), Lecture Notes in Computer Science 6756. Springer, pp. 441–452, doi:10.1007/978-3-642-22012-8_35.
  38. S. Schmitz & Ph. Schnoebelen (2012): Algorithmic Aspects of WQO Theory. Lecture notes. Available at http://cel.archives-ouvertes.fr/cel-00727025.
  39. Ph. Schnoebelen (2004): The Verification of Probabilistic Lossy Channel Systems. In: Validation of Stochastic Systems: A Guide to Current Research, Lecture Notes in Computer Science 2925. Springer, pp. 445–465, doi:10.1007/978-3-540-24611-4_13.
  40. L. S. Shapley (1953): Stochastic games. Proc. Natl. Acad. Sci. USA 39(10), pp. 1095–1100, doi:10.1073/pnas.39.10.1095.
  41. W. Zielonka (2010): Playing in stochastic environment: from multi-armed bandits to two-player games. In: Proc. 30th Conf. Found. of Software Technology and Theor. Comp. Sci. (FST&TCS 2010), Leibniz Int. Proc. in Informatics 8. Leibniz-Zentrum für Informatik, pp. 65–72, doi:10.4230/LIPIcs.FSTTCS.2010.65.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org