Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation

Algorithm 2

class

public:

 void initialize_state ;   // the initial node is defined as , the contented situation is .

 void add_state ;  adding a state to the BA. If a BA has not the state , is added to

 the BA directly. If a BA has a state with , then and is discarded.

 void add_trans ; adding a transition to the BA. If a BA has not the

 transition , is added to the BA directly. If a BA has a transition with ,

  and , then and is discarded.

 string search_state     Searching the state in the BA.

 If   , then already exists in the BA and return .

 Otherwise, return .

 string s.t.    Searching the transition in the BA. If   

 and   , then already exists in the BA and return . Otherwise, return .