Logical and stochastic modeling with SMART

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

Volumn 2794, Issue , 2003, Pages 78-97

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

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

^b ASRC Aerospace Corporation   (United States)

^c Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDUSTRIAL RESEARCH; LARGE SCALE SYSTEMS; MARKOV PROCESSES; MODEL CHECKING; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

CTL MODEL-CHECKING; INDUSTRIAL SETTINGS; LOGICAL BEHAVIOR; NUMERICAL SOLUTION; PROBABILISTIC ANALYSIS; SOLUTION ALGORITHMS; STOCHASTIC NATURE; SYMBOLIC STATE SPACE;

DISCRETE EVENT SIMULATION;

EID: 35248825902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45232-4_6     Document Type: Article

References (29)

1. C. Baier, B. R. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Proc CAV, LNCS 1855, pp. 358-372, July 2000. Springer.
2. J. Bengtsson et al. New Generation of UPPAAL. In Int. Workshop on Software Tools for Technology Transfer, June 1998.
3. J. W. Brewer. Kronecker products and matrix calculus in system theory. IEEE Trans. Circ. and Syst., CAS-25:772-781, Sept. 1978.
4. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp., 35(8):677-691, Aug. 1986.
5. 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, 2000.
6. G. Ciardo, R. German, and C. Lindemann. A characterization of the stochastic process underlying a stochastic Petri net. IEEE TSE, 20(7):506-515, July 1994.
7. G. Ciardo, G. Luettgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. Proc. ICATPN, LNCS 1825, pp. 103-122, June 2000. Springer-Verlag.
8. G. Ciardo, G. Luettgen, and R. Siminiceanu. Saturation: An efficient iteration strategy for symbolic state space generation. Proc. TACAS, LNCS 2031, pp. 328-342, Apr. 2001. Springer-Verlag.
9. G. Ciardo, R. Marmorstein, and R. Siminiceanu. Saturation unbound. In Proc. TACAS, Apr. 2003. Springer-Verlag. To appear.
10. G. Ciardo and A. S. Miner. Storage alternatives for large structured state spaces. Proc. Int. Conf. on Modeling Techniques and Tools for Computer Performance Evaluation, LNCS 1245, pp. 44-57, June 1997. Springer-Verlag.
11. G. Ciardo and A. S. Miner. A data structure for the efficient Kronecker solution of GSPNs. Proc. PNPM, pp. 22-31, Sept. 1999. IEEE Comp. Soc. Press.
12. G. Ciardo and R. Siminiceanu. Using edge-valued decision diagrams for symbolic generation of shortest paths. Proc. FMCAD, LNCS 2517, pp. 266-273, Nov. 2002.
13. G. Ciardo and K. S. Trivedi. A decomposition approach for stochastic reward net models. Perf. Eval., 18(1):37-59, 1993.
14. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier. Proc. CAV, LNCS 1633, pp. 495-499, July 1999. Springer.
15. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. Proc. IBM Workshop on Logics of Programs, pp. 52-71, 1981.
16. J. A. Couvillion et al. Performability modeling with UltraSAN. IEEE Software, pp. 69-80, Sept. 1991.
17. D. Daly, D. D. Deavours, J. M. Doyle, P. G. Webster and W. H. Sanders. Möbius: an extensible tool for performance and dependability modeling. LNCS 1786, pp. 332-336, 2000. Springer-Verlag.
18. R. L. Jones. Analysis of Phase-Type Stochastic Petri Nets with Discrete and Continuous Timing. Tech. Rep. CR-2000-210296, NASA Langley, June 2000.
19. R. L. Jones and G. Ciardo. On phased delay stochastic Petri nets: Definition and an application. Proc. PNPM, pp. 165-174, Sept. 2001. IEEE Comp. Soc. Press.
20. R. L. Jones III. Simulation and Numerical Solution of Stochastic Petri Nets with Discrete and Continuous Timing. Ph.D. thesis, College of William and Mary, Department of Computer Science, Williamsburg, VA, 2002.
21. T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli. Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic, 4(1-2):9-62, 1998.
22. M. Z. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic Symbolic Model Checker. In Proc. Comp. Perf. Eval. / TOOLS, pp. 200-204, Apr. 2003.
23. A. S. Miner. Efficient state space generation of GSPNs using decision diagrams. In Proc. DSN, pp 637-646, Washington, DC, June 2002.
24. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. Proc. ICATPN, LNCS 1639, pp. 6-25, June 1999. Springer.
25. A. S. Miner, G. Ciardo, and S. Donatelli. Using the exact state space of a Markov model to compute approximate stationary measures. Proc. ACM SIGMETRICS, pp. 207-216, June 2000. ACM Press.
26. T. Murata. Petri Nets: properties, analysis and applications. Proc. of the IEEE, 77(4):541-579, Apr. 1989.
27. E. Pastor, O. Roig, J. Cortadella, and R. Badia. Petri net analysis using boolean manipulation. Proc. ICATPN, LNCS 815, pp. 416-435, June 1994. Springer.
28. M. Tilgner, Y. Takahashi, and G. Ciardo. SNS 1.0: Synchronized Network Solver. In Int. Workshop on Manufacturing and Petri Nets, pp. 215-234, June 1996.
29. S. Yovine. Model checking timed automata. In European Educational Forum: School on Embedded Systems, pp. 114-152, 1996.