A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis

This publication has 17 references indexed in Scilit:

• Logic and stochastic modeling with S m A r T
  Performance Evaluation, 2006
• The saturation algorithm for symbolic state-space exploration
  International Journal on Software Tools for Technology Transfer, 2005
• Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
  Published by Springer Nature ,2005
• Structural Symbolic CTL Model Checking of Asynchronous Systems
  Published by Springer Nature ,2003
• Saturation: An Efficient Iteration Strategy for Symbolic State—Space Generation
  Published by Springer Nature ,2001
• Efficient Symbolic State-Space Construction for Asynchronous Systems
  Published by Springer Nature ,2000
• NuSMV: A New Symbolic Model Verifier
  Lecture Notes in Computer Science, 1999
• Efficient descriptor-vector multiplications in stochastic automata networks
  Journal of the ACM, 1998
• A decomposition approach for stochastic reward net models
  Performance Evaluation, 1993
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986