Don't know in probabilistic systems

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

Volumn 3925 LNCS, Issue , 2006, Pages 71-88

  Fecher, Harald ^a   Leucker, Martin ^b   Wolf, Verena ^c  

^a UNIVERSITY OF KIEL   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; TREES (MATHEMATICS);

CONCRETE SYSTEM; PROBABILISTIC SYSTEM; PROBABILISTIC TEMPORAL LOGIC;

COMPUTER SOFTWARE;

EID: 33745769301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691617_5     Document Type: Conference Paper

References (20)

1. Christel Baier. On the algorithmic verification of probabilistic systems, Universität Mannheim, 1998. Habilitation Thesis.
2. M. Chechik, B. Devereux, S. Easterbrook, and A. Gurfinkel. Multi-valued symbolic model-checking. ACM Transactions on Software Engineering and Methodology (TOSEM), 12:371-408, 2003.
3. E. Clarke, O. Grumberg, and D. Long. Model Checking and Abstraction. In Proc. of POPL, pages 342-354, New York, January 1992. ACM.
4. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT press, December 1999.
5. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, July 1995.
6. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reduction and refinement strategies for probabilistic analysis. In PAPM-PROBMIV, pages 57-76, 2002.
7. Luca de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical report STAN-CS-TR-98-1601.
8. P. Godefroid and R. Jagadeesan. On the expressiveness of 3-valued models. In Verification, Model Checking and Abstract Interpretation (VMCAI), volume 2575 of LNCS, pages 206-222, 2003.
9. O. Grumberg, M. Lange, M. Leucker, and S. Shoham. Don't know in the μ-calculus. In Proc. VMCAI'05, volume 3385 of LNCS. Springer, 2005.
10. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512-535, 1994.
11. M. Huth. On finite-state approximants for probabilistic computation tree logic. Theoretical Computer Science. to appear.
12. M. Huth. An abstraction framework for mixed non-deterministic and probabilistic systems. In Validation of Stochastic Systems, pages 419-444, 2004.
13. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: A foundation for three-valued program analysis. In European Symposium on Programming (ESOP), volume 2028, pages 155-169, 2001.
14. Michael Huth. Abstraction and probabilities for hybrid logics. In Qualitative Aspects of Programming Languages, 2004.
15. B. Jonsson and K. Larsen. Specification and refinement of probabilistic processes. In Proc. 6th IEEE Int. Symp. on Logic in Computer Science, 1991.
16. B. Konikowska and W. Penczek. Model checking for multi-valued computation tree logics. In Beyond two: theory and applications of multiple-valued logic, pages 193-210. Physica-Verlag GmbH, 2003.
17. B. Konikowska and W. Penczek. On designated values in multi-valued CTL* model checking. Fundamenta Informaticae, 60(1-4):221-224, 2004.
18. S. Shoham and O. Grumberg. A game-based framework for CTL counterexamplesand 3-valued abstraction-refinemnet. In Computer Aided Verification (CAV), volume 2725 of LNCS, pages 275-287, 2003.
19. R. van Glabbeek, S. Smolka, B. Steffen, and C. Tofts. Reactive, generative, and stratified models of probabilistic processes. In Logic in Computer Science, pages 130-141, 1990.
20. W. Yi. Reasoning about uncertain information compositionally. In Proc. of the 3rd International School and Symposium on Real-Time and Fault-Tolerant Systems, volume 863 of LNCS. Springer, 1994.