Symbolic representations and analysis of large probabilistic systems

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

Volumn 2925, Issue , 2004, Pages 296-338

  Miner, Andrew ^a   Parker, David ^b  

^a Iowa State University   (United States)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DIGITAL STORAGE; GRAPHIC METHODS; MANY VALUED LOGICS;

BINARY DECISION DIAGRAMS (BDDS); HIGH-LEVEL STRUCTURE; LARGE PROBABILISTIC SYSTEMS; MULTI-TERMINAL BINARY DECISION DIAGRAMS; MULTI-VALUED DECISION DIAGRAMS; PROBABILISTIC SYSTEMS; SYMBOLIC REPRESENTATION; SYMBOLIC TECHNIQUES;

BINARY DECISION DIAGRAMS;

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

References (74)

1. ∼dxp/prism.
2. ∼ciardo/SMART/.
3. S. Akers. Binary decision diagrams. IEEE Transactions on Computers, C-27(6):509-516, 1978.
4. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Verifying continuous time Markov chains. In R. Alur and T. Henzinger, editors, Proc. 8th International Conference on Computer Aided Verification (CAV'96), volume 1102 of LNCS, pages 269-276. Springer, 1996.
5. I. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic decision diagrams and their applications. In Proc. International Conference on Computer-Aided Design (ICCAD'93), pages 188-191, 1993.
6. Also available in Formal Methods in System Design, 10(2/3):171-206, 1997.
7. C. Baier. On algorithmic verification methods for probabilistic systems. Habilitation thesis, Fakultät für Mathematik & Informatik, Universität Mannheim, 1998.
8. C. Baier and E. Clarke. The algebraic mu-calculus and MTBDDs. In Proc. 5th Workshop on Logic, Language, Information and Computation (WOLLIC'98), pages 27-38, 1998.
9. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97), volume 1256 of LNCS, pages 430-440. Springer, 1997.
10. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In J. Baeten and S. Mauw, editors, Proc. 10th International Conference on Concurrency Theory (CONCUR'99), volume 1664 of LNCS, pages 146-161. Springer, 1999.
11. B. Bollig and I. Wegner. Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, 45(9):993-1006, 1996.
12. M. Bozga and O. Maler. On the representation of probabilities over structured domains. In N. Halbwachs and D. Peled, editors, Proc. 11th International Conference on Computer Aided Verification (CAV'99), volume 1633 of LNCS, pages 261-273. Springer, 1999.
13. K. Brace, R. Rudell, and R. Bryant. Efficient implementation of a BDD package. In Proc. 27th Design Automation Conference (DAC'90), pages 40-45. IEEE Computer Society Press, 1990.
14. R. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
15. R. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
16. P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp., 12(3):203-222, SUMMER 2000.
17. P. Buchholz and P. Kemper. Numerical analysis of stochastic marked graphs. In 6th Int. Workshop on Petri Nets and Performance Models (PNPM'95), pages 32-41, Durham, NC, October 1995. IEEE Comp. Soc. Press.
18. P. Buchholz and P. Kemper. Compact representations of probability distributions in the analysis of superposed GSPNs. In R. German and B. Haverkort, editors, Proc. 9th International Workshop on Petri Nets and Performance Models (PNPM'01), pages 81-90. IEEE Computer Society Press, 2001.
19. P. Buchholz and P. Kemper. Kronecker based matrix representations for large Markov models. This proceedings, 2003.
20. 20 states and beyond. In Proc. 5th Annual IEEE Symposium on Logic in Computer Science (LICS'90), pages 428-439. IEEE Computer Society Press, 1990.
21. G. Ciardo, G. Luettgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In Mogens Nielsen and Dan Simpson, editors, Application and Theory of Petri Nets 2000 (Proc. 21st Int. Conf. on Applications and Theory of Petri Nets), LNCS 1825, pages 103-122, Aarhus, Denmark, June 2000. Springer-Verlag.
22. G. Ciardo, G. Luettgen, and R. Siminiceanu. Saturation: an efficient iteration strategy for symbolic state space generation. In Tiziana Margaria and Wang Yi, editors, Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 2031, pages 328-342, Genova, Italy, April 2001. Springer-Verlag.
23. G. Ciardo and A. Miner. SMART: Simulation and Markovian analyser for reliability and timing. In Proc. 2nd International Computer Performance and Dependability Symposium (IPDS'96), page 60. IEEE Computer Society Press, 1996.
24. G. Ciardo and A. Miner. Storage alternatives for large structured state spaces. In R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, editors, Proc. 9th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, volume 1245 of LNCS, pages 44-57. Springer, 1997.
25. G. Ciardo and A. Miner. A data structure for the efficient Kronecker solution of GSPNs. In P. Buchholz and M. Silva, editors, Proc. 8th International Workshop on Petri Nets and Performance Models (PNPM'99), pages 22-31. IEEE Computer Society Press, 1999.
26. G. Ciardo and R. Siminiceanu. Using edge-valued decision diagrams for symbolic generation of shortest paths. In Mark D. Aagaard and John W. O'Leary, editors, Proc. Fourth International Conference on Formal Methods in Computer-Aided Design (FMCAD), LNCS 2517, pages 256-273, Portland, OR, USA, November 2002. Springer.
27. F. Ciesinski and F. Grössner. On probabilistic computation tree logic. This proceedings, 2003.
28. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. In Proc. International Workshop on Logic Synthesis (IWLS'93), pages 1-15, 1993.
29. Also available in Formal Methods in System Design, 10(2/3):149-169, 1997.
30. E. Clarke, K. McMillan, X. Zhao, M. Fujita, and J. Yang. Spectral transforms for large Boolean functions with applications to technology mapping. In Proc. 30th Design Automation Conference (DAC'93), pages 54-60. ACM Press, 1993.
31. Also available in Formal Methods in System Design, 10(2/3):137-148, 1997.
32. L. Cloth. Specification and verification of Markov reward models. This proceedings, 2003.
33. O. Coudert, C. Berthet, and J. C. Madre. Verification of synchronous sequential machines based on symbolic execution. In J. Sifakis, editor, Proc. International Workshop on Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 365-373. Springer, 1989.
34. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. In L. de Alfaro and S. Gilmore, editors, Proc. Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'01), volume 2165 of LNCS, pages 39-56. Springer, 2001.
35. I. Davies, W. Knottenbelt, and P. Kritzinger. Symbolic methods for the state space exploration of GSPN models. In T. Field, P. Harrison, J. Bradley, and U. Harder, editors, Proc. 12th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS'02), volume 2324 of LNCS, pages 188-199. Springer, 2002.
36. M. Davio. Kronecker products and shuffle algebra. IEEE Transactions on Computers, C-30(2):116-125, February 1981.
37. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation. In S. Graf and M. Schwartzbach, editors, Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1785 of LNCS, pages 395-410. Springer, 2000.
38. S. Donatelli. Superposed stochastic automata: A class of stochastic Petri nets amenable to parallel solution. Performance Evaluation, 18:21-36, 1993.
39. R. Enders, T. Filkorn, and D. Taubner. Generating BDDs for symbolic model checking in CCS. In K. Larsen and A. Skou, editors, Proc. 3rd International Workshop on Computer Aided Verification (CAV'91), volume 575 of LNCS, pages 203-213. Springer, 1991.
40. P. Fernandes, B. Plateau, and W. Stewart. Efficient descriptor-vector multiplication in stochastic automata networks. Journal of the ACM, 45(3):381-414, 1998.
41. M. Fujita, Y. Matsunaga, and T. Kakuda. On the variable ordering of binary decision diagrams for the application of multi-level synthesis. In European conference on Design automation, pages 50-54, 1991.
42. G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Probabilistic analysis of large finite state machines. In Proc. 31st Design Automation Conference (DAC'94), pages 270-275. ACM Press, 1994.
43. G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Markovian analysis of large finite state machines. IEEE Trans. on CAD, 15(12):1479-1493, 1996.
44. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6(5):512-535, 1994.
45. V. Hartonas-Garmhausen. Probabilistic Symbolic Model Checking with Engineering Models and Applications. PhD thesis, Carnegie Mellon University, 1998.
46. H. Hermanns, M. Kwiatkowska, G. Norman, D. Parker, and M. Siegle. On the use of MTBDDs for performability analysis and verification of stochastic systems. Journal of Logic and Algebraic Programming: Special Issue on Probabilistic Techniques for the Design and Analysis of Systems, 56(1-2):23-67, 2003.
47. H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In B. Plateau, W. Stewart, and M. Silva, editors, Proc. 3rd International Workshop on Numerical Solution of Markov Chains (NSMC'99), pages 188-207. Prensas Universitarias de Zaragoza, 1999
48. H. Hermanns and M. Siegle. Bisimulation algorithms for stochastic process algebras and their BDD-based implementation. In J.-P. Katoen, editor, Proc. 5th International AMAST Workshop on Real-Time and Probabilistic Systems (ARTS'99), volume 1601 of LNCS, pages 244-264. Springer, 1999.
49. J. Hillston and L. Kloul. An efficient Kronecker representation for PEPA models. In Proc. Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'01), pages 120-135. Springer-Verlag, September 2001.
50. T. Kam, T. Villa, R.K. Brayton, and A. Sangiovanni-Vincentelli. Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic, 4(1-2):9-62, 1998.
51. J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and symbolic CTMC model checking. In L. de Alfaro and S. Gilmore, editors, Proc. Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'01), volume 2165 of LNCS, pages 23-38. Springer, 2001.
52. M. Kuntz and M. Siegle. Deriving symbolic representations from stochastic process algebras. In H. Hermanns and R. Segala, editors, Proc. 2nd Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'02), volume 2399 of LNCS, pages 188-206. Springer, 2002.
53. M. Kwiatkowska, R. Mehmood, G. Norman, and D. Parker. A symbolic out-of-core solution method for Markov models. In Proc. Workshop on Parallel and Distributed Model Checking (PDMC'02), volume 68.4 of Electronic Notes in Theoretical Computer Science. Elsevier, 2002.
54. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In T. Field, P. Harrison, J. Bradley, and U. Harder, editors, Proc. 12th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS'02), volume 2324 of LNCS, pages 200-204. Springer, 2002.
55. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. In J.-P. Katoen and P. Stevens, editors, Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), volume 2280 of LNCS, pages 52-66. Springer, 2002.
56. M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic systems using MTBDDs and Simplex. Technical Report CSR-99-1, School of Computer Science, University of Birmingham, 1999.
57. M. Kwiatkowska, G. Norman, and R. Segala. Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM. In G. Berry, H. Comon, and A. Finkel, editors, Proc. 13th International Conference on Computer Aided Verification (CAV'01), volume 2102 of LNCS, pages 194-206. Springer, 2001.
58. C. Lee. Representation of switching circuits by binary-decision programs. Bell System Technical Journal, 38:985-999, 1959.
59. K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
60. A. Miner. Data Structures for the Analysis of Large Structured Markov Chains. PhD thesis, Department of Computer Science, College of William & Mary, Virginia, 2000.
61. A. Miner. Efficient solution of GSPNs using canonical matrix diagrams. In R. German and B. Haverkort, editors, Proc. 9th International Workshop on Petri Nets and Performance Models (PNPM'01), pages 101-110. IEEE Computer Society Press, 2001.
62. A. Miner. Efficient state space generation of GSPNs using decision diagrams. In Proc. 2002 Int. Conf. on Dependable Systems and Networks (DSN 2002), pages 637-646, Washington, DC, June 2002.
63. A. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In S. Donatelli and J. Kleijn, editors, Proc. 20th International Conference on Application and Theory of Petri Nets (ICATPN'99), volume 1639 of LNCS, pages 6-25. Springer, 1999.
64. A. Miner, G. Ciardo, and S. Donatelli. Using the exact state space of a Markov model to compute approximate stationary measures. In Proc. 2000 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pages 207-216, Santa Clara, CA, June 2000.
65. D. Parker. Implementation of Symbolic Model Checking for Probabilistic Systems. PhD thesis, University of Birmingham, 2002.
66. E. Pastor and J. Cortadella. Efficient encoding schemes for symbolic analysis of Petri nets. In Design Automation and Test in Europe (DATE'98), Paris, February 1998.
67. E. Pastor, J. Cortadella, and M. Peña. Structural methods to improve the symbolic analysis of Petri nets. In 20th International Conference on Application and Theory of Petri Nets, Williamsburg, June 1999.
68. B. Plateau. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In Proc. 1985 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, volume 13(2) of Performance Evaluation Review, pages 147-153, 1985.
69. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In Proc. International Conference on Computer-Aided Design (ICCAD'93), pages 42-47, 1993.
70. M. Siegle. Compositional representation and reduction of stochastic labelled transition systems based on decision node BDDs. In D. Baum, N. Mueller, and R. Roedler, editors, Proc. Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen (MMB'99), pages 173-185. VDE Verlag, 1999.
71. M. Siegle. Behaviour analysis of communication systems: Compositional modelling, compact representation and analysis of performability properties. Habilitation thesis, Universität Erlangen-Nürnberg, 2002.
72. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, 1994.
73. A. Xie and A. Beerel. Symbolic techniques for performance analysis of timed circuits based on average time separation of events. In Proc. 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC'97), pages 64-75. IEEE Computer Society Press, 1997.
74. D. Zampunièris. The Sharing Tree Data Structure, Theory and Applications in Formal Verification. PhD thesis, Department of Computer Science, University of Namur, Belgium, 1997.