Saturation for a general class of models

Proceedings - First International Conference on the Quantitative Evaluation of Systems, QEST 2004

Volumn , Issue , 2004, Pages 282-291

  Miner, Andrew S ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION DIAGRAMS; DISCRETE STATE MODELS; HIGH LEVEL MODELS; SATURATION ALGORITHMS;

ALGORITHMS; DATA STRUCTURES; FUNCTIONS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; SET THEORY;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 16244362698     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2004.1348042     Document Type: Conference Paper

References (18)

1. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp., C-35(8):677-691, Aug. 1986.
2. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, Sept. 1992.
3. P. Buchholz. Hierarchical structuring of superposed GSPNs. In 7th Int. Workshop on Petri Nets and Performance Models (PNPM'97), pages 81-90, Saint Malo, France, June 1997. IEEE Comp. Soc. Press.
4. J. Burch, E. Clarke, and D. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P.B. Denyer, editors, Int. Conference on Very Large Scale Integration, pages 49-58, Edinburgh, Scotland, Aug. 1991. IFIP Transactions, North-Holland.
5. 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
6. G. Ciardo, R. Jones, A. Miner, and R. Siminiceanu. Logical and stochastic modeling with SMART. In P. Kemper and W. H. Sanders, editors, Proc. 13th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, LNCS 2794, pages 78-97, Urbana, IL, USA, Sept. 2003. Springer-Verlag.
7. G. Ciardo, G. Luettgen, and R. Siminiceanu. Saturation: an efficient iteration strategy for symbolic state space generation. In T. Margaria and W. Yi, editors, Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 2031, pages 328-342, Genova, Italy, Apr. 2001. Springer-Verlag.
8. G. Ciardo, R. Marmorstein, and R. Siminiceanu. Saturation unbound. In H. Garavel and J. Hatcliff, editors, Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 2619, pages 379-393, Warsaw, Poland, Apr. 2003. Springer-Verlag.
9. G. Ciardo and K. S. Trivedi. A decomposition approach for stochastic reward net models. Perf. Eval., 18(1):37-59, 1993.
10. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
11. S. Derisavi, P. Kemper, and W. H. Sanders. Symbolic state-space exploration and numerical analysis of state-sharing composed models. In A. N. Langville and W. J. Stewart, editors, 4th Int. Conference on the Numerical Solution of Markov Chains (NSMC'03), pages 167-189, Urbana, IL, USA, Sept. 2003.
12. 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.
13. P. Kemper. Reachability analysis based on structured representations. In J. Billington and W. Reisig, editors, Application and Theory of Petri Nets 1996 (Proc. 17th Int. Conf. on Applications and Theory of Petri Nets), LNCS 1091, pages 269-288, Osaka, Japan, June 1996. Springer-Verlag.
14. A. S. Miner. Efficient solution of GSPNs using Canonical Matrix Diagrams. In R. German and B. Haverkort, editors, 9th Int. Workshop on Petri Nets and Performance Models (PNPM'01), pages 101-110, Aachen, Germany, Sept. 2001. IEEE Comp. Soc. Press.
15. A. S. Miner. Implicit GSPN reachability set generation using decision diagrams. Perf. Eval., 56(1-4):145-165, Mar. 2004.
16. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In H. Kleijn and S. Donatelli, editors, Application and Theory of Petri Nets 1999 (Proc. 20th Int. Conf. on Applications and Theory of Petri Nets), LNCS 1639, pages 6-25, Williamsburg, VA, USA, June 1999. Springer-Verlag.
17. E. Pastor, O. Roig, J. Cortadella, and R. Badia. Petri net analysis using boolean manipulation. In R. Valette, editor, Application and Theory of Petri Nets 1994 (Proc. 15th Int. Conf. on Applications and Theory of Petri Nets), LNCS 815, pages 416-435, Zaragoza, Spain, June 1994. Springer-Verlag.
18. C. M. Woodside and Y. Li. Performance Petri net analysis of communications protocol software by delay-equivalent aggregation. In 4th Int. Workshop on Petri Nets and Performance Models (PNPM'91), pages 64-73, Melbourne, Australia, Dec. 1991. IEEE Comp. Soc. Press.