An abstraction framework for mixed non-deterministic and probabilistic systems

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

Volumn 2925, Issue , 2004, Pages 419-444

  Huth, Michael ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES;

ABSTRACT MODEL-CHECKING; ABSTRACTION TECHNIQUES; MODEL CHECKING PROBLEM; MODEL-CHECKING SYSTEM; PROBABILISTIC BEHAVIOR; PROBABILISTIC SYSTEMS; QUANTITATIVE DOMAIN THEORY; RESEARCH OPPORTUNITIES;

MODEL CHECKING;

EID: 33745772616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24611-4_12     Document Type: Article

References (102)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Oxford Univ. Press, 1994.
2. J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
3. C. Baier, B. Engelen, and M. Majster-Cederbaum. Deciding Bisimilarity and Similarity for Probabilistic Processes. Journal of Computer and System Sciences, 60:187-231, 2000.
4. C. Baier and M. I. A. Stoelinga. Norm fuctions for probabilistic bisimulations with delays. In J. Tiuryn, editor, Proceedings of 3rd International Conference on Foundations of Science and Computation Structures (FOSSACS), Berlin, Germany, March 2000, volume 1784 of Lecture Notes in Computer Science, pages 1-16, 2000.
5. C. Baier, M. Kwiatkowska, and G. Norman. Computing probability bounds for linear time formulas over concurrent probabilistic systems. In M. Kwiatkowska, C. Baier, M. Huth and M. Ryan, editors, Electronic Notes in Theoretical Computer Science, volume 22. Elsevier Science Publishers, 2000.
6. J. C. Bradfield. Verifying Temporal Properties Of Systems. Birkhäuser, Boston, Mass., 1991.
7. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proceedings of the 11th Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274-287. Springer Verlag, July 1999.
8. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of CONCUR'2000 (11th International Conference on Concurrency Theory), volume 1877 of Lecture Notes in Computer Science, pages 168-182. Springer Verlag, August 2000.
9. R. R. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
10. 20 states and beyond. Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.
11. S. Cattani and R. Segala. Decision algorithms for probabilistic bisimulation. In Proceedings of the 13th International Conference on Concurrency Theory (CONCUR'02), volume 2421 of Lecture Notes in Computer Science, pages 371-385, Brno, Czech Republic, August 2002. Springer Verlag.
12. K. Cerans, J. Chr. Godskesen, and K. G. Larsen. Timed modal specification - theory and tools. In Computer Aided Verification, pages 253-267, 1993.
13. Y.-F. Chen, E. R. Gansner, and E. Koutsofios. A C++ data model supporting reachability analysis and dead code detection. In M. Jazayeri and H. Schauer, editors, Proceedings of the Sixth European Software Engineering Conference (ESEC/FSE 97), pages 414-431. Springer-Verlag, 1997.
14. D. Clark, C. Hankin, S. Hunt, and R. Nagarajan. Possibilistic Information Flow is safe for Probabilistic Non-Interference. In Workshop on Issues in the Theory of Security (WITS '00), Geneva, Switzerland, 7-8 July 2000.
15. E. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded Model Checking Using Satisfiability Solving. Formal Methods in System Design, 19(1):7-34, July 2001.
16. E. M. Clarke, M. Pujita, and X. Zhao. Representations of discrete functions, chapter 'Multi-terminal binary decision diagrams and hybrid decision diagrams', pages 93-108. Kluwer academic publishers, 1996.
17. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, January 2000.
18. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, 1994.
19. R. Cleaveland, S. A. Smolka, and A. E. Zwarico. Testing preorders for probabilistic processes. In W. Kuich, editor, Automata, Languages and Programming, 19th International Colloqium, volume 623 of Lecture Notes in Computer Science, pages 708-719, Vienna Austria, 13-17 July 1992. Springer Verlag.
20. C. Courcoubetis and M. Yannakakis. The Complexity of Probabilistic Verification. Journal of the Association of Computing Machinery, 42(4):857-907, July 1995.
21. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs. In Proc. 4th ACM Symp. on Principles of Programming Languages, pages 238-252. ACM Press, 1977.
22. P. Cousot and R. Cousot. Temporal abstract interpretation. In Conference Record of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 12-25, Boston, Mass., January 2000. ACM Press, New York, NY.
23. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands, July 1996.
24. P. R. D'Argenio, B. Jeannet, H. E. Jensen, and K. G. Larsen. Reachability Analysis of Probabilistic Systems by Successive Refinements. In L. de Alfaro and S. Gilmore, editors, Process Algebra and Probabilistic Methods: Performance Modelling and Verification, volume 2165 of Lecture Notes in Computer Science, pages 39-56, Aachen, Germany, September 12-14 2001. Springer Verlag.
25. P. R. D'Argenio, B. Jeannet, H. E. Jensen, and K. G. Larsen. Reduction and Refinement Strategies for Probabilistic Analysis. In H. Hermanns and R. Segala, editors, Process Algebra and Probabilistic Methods, Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science, pages 57-76, Copenhagen, Denmark, July 25-26 2002. Springer.
26. D. Denning. A Lattice Model of Secure Information Flow. Communications of the ACM, 19(5):236-243, 1976.
27. D. Denning. Certification of Programs for Secure Information Flow. Communications of the ACM, 20(7):504-513, 1977.
28. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for Labelled Markov Processes. Journal of Information and Computation, 179(2):163-193, December 2002.
29. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating Labeled Markov Processes. In 15th Annual IEEE Symposium on Logic in Computer Science (LICS'00), Santa Barbara, California, 26-29 June 2000. IEEE Computer Society Press.
30. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Weak Bisimulation is Sound and Complete for PCTL*. In Proc. 13th Int'l Conference CONCUR 2002 - Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 355-370, Brno, Czech Republic, 20-23 August 2002. Springer Verlag.
31. M. B. Dwyer and D. A. Schmidt. Limiting State Explosion with Filter-Based Refinement. In Proceedings of the ILPS'97 Workshop on Verification, Model Checking, and Abstraction, 1997.
32. URL: http://www.fsel.com/fdr2_download.html.
33. G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott. A Compendium of Continuous Lattices. Springer Verlag, 1980.
34. S. Gilmore and M. Ryan, editors. Language Constructs for Describing Features, Proc. of the FIREworks workshop. Springer Verlag, 2001.
35. P. Godefroid. Model Checking for Programming Languages using VeriSoft. In Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pages 174-186, Paris, January 1997.
36. S. Graf and J. Sifakis. Readiness Semantics for Regular Processes with Silent Actions. In In: Proc. of ICALP'87, pages 115-125, 1987.
37. P. R. Halmos. Measure Theory. Graduate Texts in Mathematics 18. Springer Verlag, 1950.
38. H. Hansson. Time and Probability in Formal Design of Distributed Systems. PhD thesis, Department of Computer Science, Uppsala University, Uppsala, Sweden, 1991.
39. H. A. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
40. A. Harding, M. Ryan, and P.-Y. Schobbens. Approximating ATL* in ATL. In Third International Workshop on Verification, Model Checking and Abstract Interpretation, volume 2294 of Lecture Notes in Computer Science, pages 289-301, Venice, Italy, January 21-22 2002. Springer Verlag.
41. J. Hatcliff, J. C. Corbett, M. B. Dwyer, S. Sokolowski, and H. Zheng. A formal study of slicing for multi-threaded programs with JVM concurrency primitives. In Static Analysis Symposium, pages 1-18, 1999.
42. H. Hermanns, U. Herzog, and J.-P. Katoen. Process algebra for performance evaluation. Theoretical Computer Science, 274(1-2):43-87, 2002.
43. H. Hermanns and J.-P. Katoen. Performance Evaluation := (Process Algebra + Model Checking) x Markov Chains. In K. G. Larsen and M. Nielson, editors, 12th Int'l Conference CONCUR 2001 - Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 59-81, Aalborg, Denmark, 20-25 August 2001. Springer Verlag.
44. H. Hermanns. Interactive Markov Chains, volume 2428 of Lecture Notes in Computer Science. Springer Verlag, September 2002.
45. J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, 1996.
46. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
47. M. Huth. A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems. In Proceedings of the 19th International Conference on the Foundations of Software Technology & Theoretical Computer Science, Lecture Notes in Computer Science, pages 369-380, IIT Chennai, India, December 1999. Springer Verlag.
48. M. Huth. Domains and Processes, chapter 'Domains of view: a foundation for specification and analysis', pages 183-218. Kluwer Academic Press, December 2001.
49. M. Huth. Possibilistic and Probabilistic Abstraction-Based Model Checking. In H. Hermanns and R. Segala, editors, Process Algebra and Probabilistic Methods, Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science, pages 115-134, Copenhagen, Denmark, July 25-26 2002. Springer.
50. M. Huth and M. Kwiatkowska. Quantitative analysis and model checking. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pages 111-122, Warsaw, Poland, 1997. IEEE Computer Society Press.
51. M. Huth. The interval domain: A matchmaker for aCTL and aPCTL. In M. Mislove, R. Cleaveland, and P. Mulry, editors, Electronic Notes in Theoretical Computer Science, volume 14. Elsevier Science Publishers, 2000.
52. T. Huynh and L. Tian. On some Equivalence Relations for Probabilistic Processes. Fundamenta Informaticae, 17:211-234, 1992.
53. H. Jifeng, K. Seidel, and A. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28(2-3):171-192, April 1997.
54. C. Jones. Probabilistic Nondeterminism. PhD thesis, Laboratory for the Foundations of Computer Science, University of Edinburgh, Edinburgh, Scotland, 1990. Monograph ECS-LFCS-90-105.
55. C. Jones and G. Plotkin. A probabilistic powerdomain of evaluations. In In: Proceedings of the IEEE 4th Annual Symposium on Logic in Computer Science, pages 186-195. IEEE Computer Society Press, 1989.
56. B. Jonsson and K. G. Larsen. Specification and Refinement of Probabilistic Processes. In 6th Annual IEEE Symposium on Logic in Computer Science, pages 266-277, Amsterdam, The Netherlands, 15-18 July 1991. IEEE Computer Society Press.
57. P. Kannelakis and S. Smolka. CCS Expressions, Finite State Processes and Three Problems of Equivalence. Journal of Information and Computation, 86:43-68, 1990.
58. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
59. D. Kozen. Semantics of Probabilistic Programs. Computer and System Sciences, 22:328-350, 1981.
60. D. Kozen. A Probabilistic PDL. Computer and System Sciences, 22(2):162-178, 1985.
61. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol. In H. Hermanns and R. Segala, editors, Process Algebra and Probabilistic Methods, Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science, pages 169-187, Copenhagen, Denmark, July 25-26 2002. Springer.
62. K. G. Larsen. Modal Specifications. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, pages 232-246. Springer Verlag, June 12-14 1989. International Workshop, Grenoble, France.
63. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, September 1991.
64. K. G. Larsen and B. Thomsen. A Modal Process Logic. In Third Annual Symposium on Logic in Computer Science, pages 203-210. IEEE Computer Society Press, 1988.
65. R. Lassaigne and S. Peyronnet. Approximate Verification of Probabilistic Systems. In H. Hermanns and R. Segala, editors, Process Algebra and Probabilistic Methods, Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science, pages 213-214, Copenhagen, Denmark, July 25-26 2002. Springer.
66. K. Martin. The measurement process in domain theory. In Proc. of Automata, Languages and Programming (ICALP'00), pages 116-126, 2000.
67. A. McIver and C. Morgan. Almost-certain eventualities and abstract probabilities in quantitative temporal logic. In C. Fidge, editor, Electronic Notes in Theoretical Computer Science, volume 42. Elsevier Science Publishers, 2001.
68. A. McIver and C. Morgan. Games, probability and the quantitative μ-calculus qMμ. In Proc. 9th Int. Conf. on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2002, volume 2514 of Lecture Notes in Artificial Intelligence, pages 292-310, Tbilisi, Georgia, 2002. Springer Verlag.
69. R. Milner. An algebraic definition of simulation between programs. In 2nd International Joint Conference on Artificial Intelligence, pages 481-489, London, United Kingdom, 1971. British Computer Society.
70. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
71. R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
72. D. Monniaux. Abstract interpretation of programs as Markov decision processes. Technical report, Départment d'Informatique, École Normale Supérieure, 45, rue d'Ulm, 75230 Paris cedex 5, France, 2001.
73. D. Monniaux. Backwards abstract interpretation of probabilistic programs. In European Symposium on Programming Languages and Systems (ESOP '01), number 2028 in Lecture Notes in Computer Science. Springer-Verlag, 2001.
74. D. Monniaux. Abstract interpretation of probabilistic semantics. In Seventh International Static Analysis Symposium (SAS'00), number 1824 in Lecture Notes in Computer Science. Springer-Verlag, 2000. Extended version on the author's web site.
75. D. Monniaux. An abstract analysis of the probabilistic termination of programs. In 8th International Static Analysis Symposium (SAS'01), number 2126 in Lecture Notes in Computer Science. Springer-Verlag, 2001.
76. D. Monniaux. An abstract Monte-Carlo method for the analysis of probabilistic programs (extended abstract). In 28th Symposium on Principles of Programming Languages (POPL '01), pages 93-101. Association for Computer Machinery, 2001.
77. D. Monniaux. Analyse de programmes probabilistes par interprétation abstraite. Thèse de doctorat, Université Paris IX Dauphine, 2001. Résumé étendu en français. Contents in English.
78. C. Morgan, A. McIver, K. Seidel, and J. W. Sanders. Refinement-oriented probability for CSP. Formal Aspects of Computing, 8(6):617-647, 1996.
79. C. Morgan and A. McIver. An expectation-based model for probabilistic temporal logic. Logic Journal of the IGPL, 7(6):779-804, 1999.
80. C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-353, May 1996.
81. R. Motvani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
82. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer Verlag, 1999.
83. C. H. Papadimitriou. Games against nature. Journal of Computer and System Sciences, 31:288-301, 1985.
84. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
85. D. M. R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, In Proc. of the 5th GI Conference, volume 104 of Lecture Notes in Computer Science, pages 167-183. Springer Verlag, 1989.
86. C. S. Pasareanu. DEOS kernel: Environment modeling using LTL assumptions. Technical Report #NASA-ARC-IC-2000-196, NASA Ames, July 2000.
87. A. Phillipou, I. Lee, and O. Sokolsky. Weak Bisimulation for Probabilistic Systems. In Proceedings of the 11th International Conference on Concurrency Theory (CONCUR '02), volume 1877 of Lecture Notes in Computer Science, pages 334-349, University Park, Pennsylvania, August 2000. Springer Verlag.
88. A. Di Pierro, C. Hankin, and H. Wiklicky. Approximate Non-interference. In CSFW'02 15th IEEE Computer Security Foundation Workshop, pages 1-15, June 2002.
89. A. Di Pierro and H. Wicklicky. Probabilistic Abstract Interpretation and Statistical Testing. In H. Hermanns and R. Segala, editors, Process Algebra and Probabilistic Methods, Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science, pages 211-212, Copenhagen, Denmark, July 25-26 2002. Springer.
90. G. D. Plotkin. A Structural Approach to Operational Semantics. Technical Report FN-19, DAIMI, Computer Science Department, Aarhus University, Ny Munkegade, Building 540, DK-8000 Aarhus, Denmark, September 1981. Reprinted April 1991.
91. M. L. Puterman. Markov decision processes: discrete stochastic dynamic programming. Wiley Series in Probability and Mathematical Statistics. John Wiley & Sons, 1994.
92. R. I. Bahar, E. A. Frohm, C. M. Gaona, G. D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and Their Applications. In IEEE /ACM International Conference on CAD, pages 188-191, Santa Clara, California, 1993. IEEE Computer Society Press.
93. M. Sagiv, T. Reps, and R. Wilhelm. Parametric Shape Analysis via 3-Valued Logic. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages, pages 105-118, January 20-22, San Antonio, Texas 1999.
94. D. Scott. Continuous lattices. In F. W. Lawvere, editor, Toposes, Algebraic Geometry and Logic, volume 274 of Lecture Notes in Mathematics, pages 97-136. Springer Verlag, 1972.
95. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, June 1995. Available as Technical Report MIT/LCS/TR-676.
96. R. Segala and N. Lynch. Probabilistic Simulations for Probabilistic Processes. Nordic Journal of Computing, 2(2):250-273, Summer 1995.
97. K. Seidel, C. Morgan, and A. McIver. An introduction to probabilistic predicate transformers. Technical Report PRG-TR-6-96, Programming Research Group, Oxford Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, 1996.
98. B. Selic. Physical programming: Beyond mere logic, April 2001. Invited Talk at ETAPS 2001.
99. R. J. van Glabbeek and W. P. Weijland. Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM, 43(3):555-600, May 1996.
100. M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th IEEE Symp. on Foundations of Computer Science, pages 327-338, Portland, Oregon, October 1985.
101. D. Volpano. Provably secure programming languages for remote evaluation. ACM Computing Surveys, 28A(2): electronic, December 1996.
102. P. Waszkiewicz. Quantitative Continuous Domains. PhD thesis, School of Computer Science, University of Birmingham, United Kingdom, July 2002.