Approximate Symbolic Reachability of Networks of Transition Systems

[1]  Supratik Chakraborty,et al.  Efficient guided symbolic reachability using reachability expressions , 2007, International Journal on Software Tools for Technology Transfer.

[2]  Marco Pistore,et al.  Nusmv version 2: an opensource tool for symbolic model checking , 2002, CAV 2002.

[3]  Gianpiero Cabodi,et al.  Improving symbolic reachability analysis by means of activityprofiles , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  F. Somenzi,et al.  To split or to conjoin: the question in image computation , 2000, Proceedings 37th Design Automation Conference.

[5]  David L. Dill,et al.  Approximate Symbolic Model Checking using Overlapping Projections , 1999, SMC@FLoC.

[6]  Enrico Macii,et al.  Algorithms for approximate FSM traversal based on state space decomposition , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Olivier Coudert,et al.  A unified framework for the formal verification of sequential circuits , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[8]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.