Efficient Guided Symbolic Reachability Using Reachability Expressions [chapter]

Dina Thomas, Supratik Chakraborty, Paritosh Pandya
2006 Lecture Notes in Computer Science  
Asynchronous systems consist of a set of transitions which are non-deterministically chosen and executed. We present a theory of guiding symbolic reachability in such systems by scheduling clusters of transitions. A theory of reachability expressions which specify the schedules is presented. This theory allows proving equivalence of different schedules which may have radically different performance in BDD-based search. We present experimental evidence to show that optimized reachability
more » ... ons give rise to significant performance advantages. The profiling is carried out in the NuSMV framework using examples from discrete timed automata and circuits with delays. A variant tool called NuSMV-DP has been developed for interpreting reachability expressions to carry out the experiments.
doi:10.1007/11691372_8 fatcat:oxtp76jb2jc7dfwdn3osw56z6a