Research Article
Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation
Algorithm 3
The main algorithm of ltltoba.
| (1) Input: an LTL formula ; | | (2) Output: a BA corresponding to ; | | (3) | | (4) procedure LTL_to_BA_translation | | (5) ; | | (6) BA.initialize_state; | | (7) while do | | (8) let ; | | (9) ; | | (10) ; | | (11) for each at the top level in do | | (12) ; | | (13) simplify; | | (14) end for | | (15) DisjunctSet the DNF of ; | | (16) for each do | | (17) let ; | | (18) (**); | | (19) (***); | | (20) if then | | (21) ; | | (22) NodeSet NodeSet ; | | (23) end if | | (24) if then | | (25) | | (26) else | | (27) let ; | | (28) ; | | (29) ; | | (30) end if | | (31) end for | | (32) end while | | (33) return BA; | | (34) End procedure |
|