Abstract

Due to the state-space explosion, many synthesis and verification problems for discrete event systems cannot be solved using traditional state-space traversal algorithms. This work presents efficient methods for reachability search based on symbolic computations using Binary Decision Diagrams. In addition, simple guidelines and quantities for separating hard and easy reachability problems are presented. Furthermore, the performance of the presented algorithms and heuristics is demonstrated on a set of industrial benchmark examples. It is also shown that such examples are much more challenging than some well-known handmade benchmark models. This is also indicated by the presented hardness quantities.

Links and resources

Tags