Saturation unbound

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

Volumn 2619, Issue , 2003, Pages 379-393

  Ciardo, Gianfranco ^a   Marmorstein, Robert ^a   Siminiceanu, Radu ^a  

^a The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY DECISION DIAGRAMS; MANY VALUED LOGICS;

GLOBAL STATE; KRONECKER; MULTI-VALUED DECISION DIAGRAMS; ORDERS OF MAGNITUDE; PRIORI KNOWLEDGE; SPACE AND TIME; SUBMODELS; SYMBOLIC STATE SPACE;

ITERATIVE METHODS;

EID: 35248894348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_27     Document Type: Article

References (27)

1. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. John Wiley & Sons, New York, 1995.
2. V. Amoia, G. De Micheli, and M. Santomauro. Computer-oriented formulation of transition-rate matrices via Kronecker algebra. IEEE Trans. Rel., 30:123-132, June 1981.
3. R. Bloem, K. Ravi, and F. Somenzi. Symbolic guided search for CTL model checking. In Proc. 37th Conf. on Design Automation, p. 29-34. ACM Press, 2000.
4. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Computer Aided Verification, pages 403-418, 2000.
5. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp., 35(8):677-691, Aug. 1986.
6. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surv., 24(3):393-318, 1992.
7. 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.
8. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proc. 5th Annual IEEE Symp. on Logic in Computer Science, pages 428-439, Philadelphia, PA, 4-7 June 1990. IEEE Comp. Soc. Press.
9. G. Ciardo. Petri nets with marking-dependent arc multiplicity: properties and analysis. In R. Valette, editor, Proc. 15th Int. Conf. on Applications and Theory of Petri Nets, LNCS 815, pages 179-198, Zaragoza, Spain, June 1994. Springer-Verlag.
10. G. Ciardo, R. L. Jones, A. S. Miner, and R. Siminiceanu. SMART: Stochastic Model Analyzer for Reliability and Timing. In P. Kemper, editor, Tools of Int. Multiconference on Measurement, Modelling and Evaluation of Computer-Communication Systems, pages 29-34, Aachen, Germany, Sept. 2001.
11. G. Ciardo, G. Luettgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In M. Nielsen and D. Simpson, editors, Proc. 21th Int. Conf. on Applications and Theory of Petri Nets, LNCS 1825, pages 103-122, Aarhus, Denmark, June 2000. Springer-Verlag.
12. 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.
13. G. Ciardo and R. Siminiceanu. Using edge-valued decision diagrams for symbolic generation of shortest paths. In M. D. Aagaard and J. W. O'Leary, editors, Proc. Fourth International Conference on Formal Methods in Computer-Aided Design (FMCAD), LNCS 2517, pages 256-273, Portland, OR, USA, Nov. 2002. Springer-Verlag.
14. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model verifier. In CAV '99, LNCS 1633, pages 495-499. Springer-Verlag, 1999.
15. O. Coudert and J. C. Madre. Symbolic computation of the valid states of a sequential machine: algorithms and discussion. In 1991 Int. Workshop on Formal Methods in VLSI Design, pages 1-19, Miami, FL, USA, 1991.
16. M. Fujita, H. Fujisawa, and Y. Matsunaga. Variable ordering algorithms for ordered binary decision diagrams and their evaluation. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 12(1):6-12, 1993.
17. A. Geser, J. Knoop, G. Lüttgen, B. Steffen, and O. Rüthing. Chaotic fixed point iterations. Technical Report MIP-9403, Univ. of Passau, 1994.
18. P. Godefroid and D. E. Long. Symbolic protocol verification with queue BDDs. Formal Methods in System Design, 14(3):257-271, May 1999.
19. J. G. Henriksen, J. L. Jensen, M. E. Jørgensen, N. Klarlund, R. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In E. Brinksma, R. Cleaveland, K. G. Larsen, T. Margaria, and B. Steffen, editors, Tools and Algorithms for the Construction and Analysis of Systems, volume 1019, pages 89-110. Springer, 1995.
20. J.R. Burch, E.M. Clarke, and D.E. 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.
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. J. Martinez and M. Silva. A simple and fast algorithm to obtain all invariants of a generalised Petri net. In Proc. 2nd European Workshop on Application and Theory of Petri Nets, pages 411-422, Bad Honnef, Germany, 1981.
23. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In H. Kleijn and S. Donatelli, editors, Proc. 20th Int. Conf. on Applications and Theory of Petri Nets, LNCS 1639, pages 6-25, Williamsburg, VA, USA, June 1999. Springer-Verlag.
24. T. Murata and R. Church. Analysis of marked graphs and Petri nets by matrix equations. Research report MDC 1.1.8, Department of information engineering, Univeristy of Illinois, Chicago, IL, Nov. 1975.
25. B. Plateau. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In Proc. ACM SIGMETRICS, pages 147-153, Austin, TX, USA, May 1985.
26. K. Ravi and F. Somenzi. Efficient fixpoint computation for invariant checking. In Proc. Int. Conference on Computer Design (ICCD), pages 467-474, Austin, TX, Oct. 1999. IEEE Comp. Soc. Press.
27. ∼fabio/CUDD/cuddIntro.html.