Abstract
We present on-the-fly degeneralization algorithm used to transform generalized Büchi automata (GBA) into Büchi Automata (BA) different from the standard degeneralization algorithm. Contented situation, which is used to record what acceptance conditions are satisfiable during expanding LTL formulae, is attached to the states and transitions in the BA. In order to get the deterministic BA, the Shannon expansion is used recursively when we expand LTL formulae by applying the tableau rules. On-the-fly degeneralization algorithm is carried out in each step of the expansion of LTL formulae. Ordered binary decision diagrams are used to represent the BA and simplify LTL formulae. The temporary automata are stored as syntax directed acyclic graph in order to save storage space. These ideas are implemented in a conversion algorithm used to build a property automaton corresponding to the given LTL formulae. We compare our method to previous work and show that it is more efficient for four sets of random formulae generated by LBTT.
Highlights
Model checking [1] is a formal verification technique used to check whether a model of the system verifies some desired properties for software or hardware systems
When the given property is expressed in an linear temporal logic (LTL) formula, the model checker usually transforms the negation of the LTL formula into a Buchi automaton (BA), builds the product of this BA with the system described as an automaton, and checks the emptiness of the product automaton
Our research focuses on an efficient conversion algorithm producing a BA corresponding to an LTL formula directly
Summary
Model checking [1] is a formal verification technique used to check whether a model of the system verifies some desired properties for software or hardware systems. Gerth et al [7] proposed a classic algorithm that translates an LTL formula into a generalized Buchi automaton (GBA). This algorithm is a tableau-based translation method in on-the-fly fashion and has been applied in Spin [8]. Clarke et al presented a standard degeneralization algorithm used to transform GBA into BA in Section 9.2.2 of [1]. The standard degeneralization algorithm is used to transform a GBA or a TGBA into a BA, only when the expansion of LTL formulae is finished. We present on-the-fly degeneralization algorithm that is used to transform a GBA or a TGBA into an equivalent BA during expanding LTL formulae.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
