Abstract

Xeve is a verification environment for Esterel programs modeled as Finite State Machines (FSMs) with a user-friendly graphical interface. It works on implicitly defined FSMs described as a set of boolean equations with latches, as generated by the Esterel compiler. It is based on the TiGeR library which provides data structures and algorithms to manipulate FSMs symbolically using BDDs. The set of boolean equations is given in the Blif format, the input format of Xeve. Xeve provides two main verification functions. The first function is the FSM state minimization using a notion of bisimulation equivalence that relates states indistinguishable when exploring the FSM graph from them. The minimization is made modulo a set of input/output signals declared as hidden. Minimized FSMs are generated explicitly in a textual format called Fc2 that can be loaded in the tool ATG for graphical exploration. The other verification function is the checking of the status of output signals: one can verif...

Citations