Hintikka games for PCTL on labeled Markov chains

Proceedings - 5th International Conference on the Quantitative Evaluation of Systems, QEST 2008

Volumn , Issue , 2008, Pages 169-178

  Fecher, Harald ^a   Huth, Michael ^b   Piterman, Nir ^b   Wagner, Daniel ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ACCEPTANCE CONDITIONS; AS MODELS; COMPOSITIONALITY; COUNTEREXAMPLE GENERATIONS; DENOTATIONAL SEMANTICS; MARKOV CHAINS; NORMAL FORMS; PARSE TREES; PROBABILISTIC MODEL CHECKING; PROBABILISTIC TEMPORAL LOGICS; PROBABILITY THRESHOLDS; WINNING STRATEGIES;

GAME THEORY; INFORMATION THEORY; MARKOV PROCESSES; PROBABILITY; SOFTWARE TESTING; TEMPORAL LOGIC;

MODEL CHECKING;

EID: 56649111384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2008.10     Document Type: Conference Paper

References (13)

1. IEEE standard for a high performance serial bus, August 1996. Std 1394-1995.
2. H. Aljazzar and S. Leue. Counterexamples for model checking of markov decision processes. Technical Report soft-08-01, University of Konstanz, 2007.
3. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for Labelled Markov Processes. Information and Computation, 179:163-193, 2002.
4. D. Fischer, E. Grädel, and L. Kaiser. Model checking games for the quantitative? μ-calculus. In 25th STACS, Dagstuhl Seminar Proceedings, pages 301-312. IBFI, Schloss Dagstuhl, Germany, 2008.
5. T. Han and J.-P. Katoen. Counterexamples in probabilistic model checking. In 13th TACAS, LNCS 4424, pages 72-86. Springer-Verlag, 2007.
6. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512-535, 1994.
7. J. Hintikka. Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic. Clarendon Press, Oxford, 1973.
8. J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. Springer Verlag, 1976. Second Edition.
9. D. Kozen. Semantics of probabilistic programs. Journal of Computer and Systems Sciences, 22:328-350, 1981.
10. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: probabilistic symbolic model checker. In 12th CPE / TOOLS, LNCS 2324, pages 200-204. Springer-Verlag, 2002.
11. D. A. Martin. Borel Determinacy. Annals of Mathematics, 102:363-371, 1975.
12. C. Morgan and A. McIver. Results on the quantitative μ-calculus qmμ. ACM Transactions on Computational Logic (TOCL), 8(1), 2007.
13. T. Wilke. Alternating tree automata, parity games, and modal μ-calculus. Bull. Soc. Math. Belg., 8(2), May 2001.