Interacting Finite State Machines
暂无分享,去创建一个
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the communi cation structure of the system. Communication complexity arguments are used to prove upper bounds on the size of the BDD for the transition relation of the product machine in terms of the communication graph, and optimal orderings are exhibited for a variety of regular systems. Based on the bounds we formulate algorithms for variable ordering. We perform reached state analysison a number of standard verification benchmarks to test the effectiveness of our ordering strategy; experimental results demonstrate the efficacy of our approach. •This research was supported by SRC 93-DC-008
[1] Sofia Cassel,et al. Graph-Based Algorithms for Boolean Function Manipulation , 2012 .
[2] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[3] R. Brayton,et al. Automatic compositional minimization in CTL model checking , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.
[4] R. P. Kurshan,et al. Analysis of discrete evnet coordination , 1990 .
[5] Jeffrey D Ullma. Computational Aspects of VLSI , 1984 .