Logic and stochastic modeling with S m A r T

Performance Evaluation

Volumn 63, Issue 6, 2006, Pages 578-608

  Ciardo, G ^a   Jones III, R L ^b   Miner, A S ^c   Siminiceanu, R I ^d  

^a University of California Riverside   (United States)

^b ASRC Aerospace Corporation   (United States)

^c Iowa State University   (United States)

^d NATIONAL INSTITUTE OF AEROSPACE   (United States)

Author keywords

Markov chains; Model checking; Simulation; State space analysis; Stochastic modeling

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; FORMAL LOGIC; LARGE SCALE SYSTEMS; MARKOV PROCESSES; NUMERICAL METHODS; PROBABILITY;

CTL MODEL-CHECKING ALGORITHMS; MODEL CHECKING; STATE SPACE ANALYSIS; STOCHASTIC MODELING;

COMPUTER SOFTWARE;

EID: 33645857666     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2005.06.001     Document Type: Article

References (46)

1. Cimatti A., Clarke E.M., Giunchiglia F., and Roveri M. NUSMV: a new symbolic model checker. Softw. Tools Technol. Transfer 2 4 (2000) 410-425
2. G.J. Holzmann, The SPIN Model Checker, Addison-Wesley, Boston, MA, USA, 2003.
3. Couvillion J., Freire R., Johnson R., Obal W.D., Qureshi M.A., Rai M., Sanders W.H., and Tvedt II J.E. Performability modeling with UltraSAN. IEEE Softw. (1991) 69-80
4. Deavours D.D., Clark G., Courtney T., Daly D., Derisavi S., Doyle J.M., Sanders W.H., and Webster P.G. The Möbius framework and its implementation. IEEE Trans. Softw. Eng. (2002) 956-969
5. Kwiatkowska M.Z., Norman G., and Parker D. Probabilistic symbolic model checking with PRISM: a hybrid approach. Softw. Tools Technol. Transfer 6 2 (2004) 128-142
6. Hermanns H., Katoen J.-P., Meyer-Kayser J., and Siegle M. A tool for model checking Markov chains. Softw. Tools Technol. Transfer 4 2 (2003) 153-172
7. Yovine S. Model Checking Timed Automata, European Educational Forum: School on Embedded Systems, LNCS 1494 (1996), Springer-Verlag, London, UK pp. 114-152
8. G. Behrmann, A. David, K.G. Larsen, A tutorial on UPPAAL, formal methods for the design of real-time systems, International School on Formal Methods for the Design of Computer, Communication and Software Systems (SFM-RT 2004), 2004, pp. 200-236.
9. Siminiceanu R., and Ciardo G. Formal verification of the NASA runway safety monitor. In: Huth M. (Ed). Electronic Notes in Theoretical Computer Science, Proceedings of the Fourth International Workshop on Automated Verification of Critical Systems (AVoCS'04). London, UK (2004)
10. Murata T. Petri nets: properties, analysis and applications. Proc. IEEE 77 4 (1989) 541-579
11. Ciardo G., and Miner A.S. Storage alternatives for large structured state spaces. In: Marie R., Plateau B., Calzarossa M., and Rubino G. (Eds). Proceedings of the Ninth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, LNCS 1245 (1997), Springer-Verlag, St. Malo, France 44-57
12. Kam T., Villa T., Brayton R., and Sangiovanni-Vincentelli A. Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic 4 1/2 (1998) 9-62
13. Miner A.S., and Ciardo G. Efficient reachability set generation and storage using decision diagrams. In: Kleijn H., and Donatelli S. (Eds). Proceedings of the 20th International Conference on Applications and Theory of Petri Nets, LNCS 1639 (1999), Springer-Verlag, Williamsburg, VA, USA 6-25
14. Brewer J.W. Kronecker products and matrix calculus in system theory. IEEE Trans. Circ. Syst. CAS-25 (1978) 772-781
15. Ciardo G., and Miner A.S. A data structure for the efficient Kronecker solution of GSPNs. In: Buchholz P. (Ed). Proceedings of the Eighth International Workshop on Petri Nets and Performance Models (PNPM'99) (1999), IEEE Comp. Soc. Press, Zaragoza, Spain 22-31
16. Miner A.S. Implicit GSPN reachability set generation using decision diagrams. Perf. Eval. 56 1-4 (2004) 145-165
17. Ciardo G., Luettgen G., and Siminiceanu R. Efficient symbolic state-space construction for asynchronous systems. In: Nielsen M., and Simpson D. (Eds). Proceedings of the 21st International Conference on Applications and Theory of Petri Nets, LNCS 1825 (2000), Springer-Verlag, Aarhus, Denmark 103-122
18. Ciardo G., Luettgen G., and Siminiceanu R. Saturation: an efficient iteration strategy for symbolic state space generation. In: Margaria T., and Yi W. (Eds). Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 2031 (2001), Springer-Verlag, Genova, Italy 328-342
19. Ciardo G., Marmorstein R., and Siminiceanu R. Saturation unbound. In: Garavel H., and Hatcliff J. (Eds). Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 2619 (2003), Springer-Verlag, Warsaw, Poland 379-393
20. Ciardo G., and Siminiceanu R. Structural symbolic CTL model checking of asynchronous systems,. In: Hunt W., and Somenzi Jr. F. (Eds). Computer Aided Verification (CAV'03), LNCS 2725 (2003), Springer-Verlag, Boulder, CO, USA 40-53
21. Buchholz P., Ciardo G., Donatelli S., and Kemper P. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comput. 12 3 (2000) 203-222
22. Miner A.S. Efficient solution of GSPNs using canonical matrix diagrams. In: German R., and Haverkort B. (Eds). Proceedings of the Ninth International Workshop on Petri Nets and Performance Models (PNPM'01) (2001), IEEE Comp. Soc. Press, Aachen, Germany 101-110
23. Ciardo G., German R., and Lindemann C. A characterization of the stochastic process underlying a stochastic Petri net. IEEE Trans. Softw. Eng. 20 7 (1994) 506-515
24. Jones R.L., and Ciardo G. On phased delay stochastic Petri nets: definition and an application. In: German R., and Haverkort B. (Eds). Proceedings of the Ninth International Workshop on Petri Nets and Performance Models (PNPM'01) (2001), IEEE Comp. Soc. Press, Aachen, Germany 165-174
25. Ciardo G., and Trivedi K.S. A decomposition approach for stochastic reward net models. Perf. Eval. 18 1 (1993) 37-59
26. Neuts M.F. Matrix-geometric Solutions in Stochastic Models (1981), Johns Hopkins University Press, Baltimore, MD, USA
27. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, New York, NY, USA, 1996.
28. R. Rudell, Dynamic variable ordering for ordered binary decision diagrams, Proceedings of the International Conference on CAD, Santa Clara, CA, USA, 1993, pp. 139-144.
29. Bryant R.E. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24 3 (1992) 293-318
30. Bollig B., and Wegener I. Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45 9 (1996) 993-1002
31. Bryant R.E. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35 8 (1986) 677-691
32. E.M. Clarke, E.A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Proceedings of the IBM Workshop on Logics of Programs, LNCS 131, Springer-Verlag, London, UK, 1981, pp. 52-71.
33. Laroussinie F., and Schnoebelen P. Specification in CTL + Past for verification in CTL. Inform. Comput. 156 1/2 (2000) 236-263
34. Ciardo G., and Siminiceanu R. Using edge-valued decision diagrams for symbolic generation of shortest paths. In: Aagaard M.D., and O'Leary J.W. (Eds). Proceedings of the Fourth International Conference on Formal Methods in Computer-aided Design (FMCAD), LNCS 2517 (2002), Springer-Verlag, Portland, OR, USA 256-273
35. R.L. Jones, Simulation and numerical solution of stochastic Petri nets with discrete and continuous timing, Ph.D. Thesis, College of William and Mary, Williamsburg, VA, USA, 2002.
36. R.L. Jones, Analysis of phase-type stochastic Petri nets with discrete and continuous timing, Technical Report CR-2000-210296, NASA Langley Research Center, Hampton, VA, USA, 2000
37. Sleator, and Tarjan. Self-adjusting binary search trees. J. ACM 32 3 (1985) 652-686
38. Brown R. Calendar queues: a fast O ( 1 ) priority queue implementation for the simulation event set problem. Commun. ACM 31 10 (1988) 1220-1227
39. Brown M.R. Implementation and analysis of binomial queue algorithms. SIAM J. Comput. 7 (1978) 298-319
40. S.G. Henderson, P.W. Glynn, Regenerative steady-state simulation of discrete-event systems, ACM TOMACS 11 (4).
41. Jones R.L., and Ciardo G. Regenerative simulation of stochastic Petri nets with discrete and continuous timing. Proceedings of the Sixth International Workshop on Performability Modeling of Computer and Communication Systems (PMCCS-6). Monticello, IL, USA (2003) 23-26
42. Miner A.S. Computing response time distributions using stochastic Petri nets and matrix diagrams. In: Ciardo G., and Sanders W.H. (Eds). Proceedings of the 10th International Workshop on Petri Nets and Performance Models (PNPM'03) (2003), IEEE Comp. Soc. Press, Urbana-Champaign, IL, USA 10-19
43. Ajmone Marsan M., Donatelli S., Neri F., and Scalia A. Approximate GSPN analysis of multiserver polling systems. Proceedings of the International Conference on Telecommunication, Distribution and Parallelism (TDP'96) (1996), La Londe Les Maures, France
44. Miner A.S., Ciardo G., and Donatelli S. Using the exact state space of a Markov model to compute approximate stationary measures. In: Kurose J., and Nain P. (Eds). Proceedings of the ACM SIGMETRICS (2000), ACM Press, Santa Clara, CA, USA 207-216
45. Baier C., Haverkort B., Hermanns H., and Katoen J.-P. Model checking algorithms for continuous-time Markov chains. IEEE Trans. Softw. Eng. 29 6 (2003) 524-541
46. Hansson H., and Jonsson B. A logic for reasoning about time and reliability. Formal Aspects Comput. 6 5 (1994) 512-535