Minimization of large state spaces using symbolic branching bisimulation

2006 IEEE Design and Diagnostics of Electronic Circuits and systems

Volumn 2006, Issue , 2006, Pages 7-12

  Wimmer, Ralf ^a   Herbstritt, Marc ^a   Becker, Bernd ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; DATA STRUCTURES; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; ROBUSTNESS (CONTROL SYSTEMS);

BISIMULATIONS; FINITE STATE SYSTEMS; SYMBOLIC APPROACH;

STATE SPACE METHODS;

EID: 33847134346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DDECS.2006.1649562     Document Type: Conference Paper

References (20)

1. R. J. van Glabbeek and W. P. Weijland, "Branching time and abstraction in bisimulation semantics," Journal of the ACM, vol. 43, no. 3, pp. 555-600, 1996.
2. J. F. Groote and F. W. Vaandrager, "An efficient algorithm for branching bisimulation and stuttering equivalence," in Automata, Languages and Programming, ser. LNCS, M. S. Paterson, Ed., vol. 443. Springer, 1990, pp. 626-638.
3. T. Bienmüller, W. Damm, and H. Wittke, "The STATEMATE Verification Environment - Making It Real," in Proc. of CAV, 2000, pp. 561-567.
4. R. Bryant, "Graph - based algorithms for Boolean function manipulation," IEEE Trans. on Comp., vol. 35, no. 8, pp. 677-691, 1986.
5. K. Fisler and M. Y. Vardi, "Bisimulation and model checking." in CHARME, ser. LNCS, L. Pierre and T. Kropf, Eds., vol. 1703. Springer, 1999, pp. 338-341.
6. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle, "A markov chain model checker." in TACAS, ser. Lecture Notes in Computer Science, S. Graf and M. I. Schwartzbach, Eds., vol. 1785. Springer, 2000, pp. 347-362.
7. J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu, "CADP: A Protocol Validation and Verification Toolbox," in Proc. of CAV, 1996, pp. 437-440.
8. A. Bouali and R. de Simone, "Symbolic bisimulation minimisation," in Proc. of CAV, ser. LNCS, vol. 443, 1992, pp. 96-108.
9. R. Enders, T. Filkorn, and D. Taubner, "Generating BDDs for Symbolic Model Checking in CCS," Distributed Computing, vol. 6, no. 3, pp. 155-164, 1993.
10. H. Garavel, F. Lang, and R. Mateescu, "An overview of CADP 2001," European Association for Software Science and Technology (EASST) Newsletter, vol. 4, pp. 13-24, 2002.
11. A. Bouali, A. Ressouche, R. de Simone, and V. Roy, The FC-tools User Manual.
12. H. Hermanns and M. Siegle, "Bisimulation Algorithms for Stochastic Process Algebra and Their BDD-Based Implementations," in ARTS, ser. LNCS, J.-P. Katoen, Ed., vol. 1601. Springer, 1999, pp. 244-264.
13. S. Blom and S. Orzan, "Distributed branching bisimulation reduction of state spaces," in Proc. of 2nd International Workshop on Parallel and Distributed Model Checking, 2003.
14. T. Basten, "Branching bisimilarity is an equivalence indeed!" in Information Processing Letters, vol. 58(3), 1996, pp. 141-147.
15. I. Wegener, Branching programs and binary decision diagrams, ser. SIAM Monographs on Discrete Mathematics and Applications. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), 2000, theory and applications.
16. R. Drechsler and B. Becker, Binary Decision Diagrams - Theory and Implementation. Kluwer Academic Publishers, 1998.
17. Y. Matsunaga, P. C. McGeer, and R. K. Brayton, "On computing the transitive closure of a state transition relation, in Proc. of DAC, 1993, pp. 260-265.
18. F. Somenzi, CUDD: CU Decision Diagram Package Release 2.4.1. University of Colorado at Boulder, 2005.
19. M. Kuntz, M. Siegle, and E. Werner, "Symbolic performance and dependability evaluation with the tool CASPA," in FORTE Workshops, ser. LNCS, M. Núñez, Z. Maamar, F. L. Pelayo, K. Pousttchi, and F. Rubio, Eds., vol. 3236. Springer, 2004, pp. 293-307.
20. G. Ciardo and M. Tilgner, "On the use of Kronecker operators for the solution of generalized stochastic Petri nets," NASA Research Center, Tech. Rep. 96-35, 1996.