Volume 9 Number 4 (Apr. 2014)
Home > Archive > 2014 > Volume 9 Number 4 (Apr. 2014) >
JSW 2014 Vol.9(4): 970-976 ISSN: 1796-217X
doi: 10.4304/jsw.9.4.970-976

Conversion Algorithm of Linear-Time Temporal Logic to B¨uchi Automata

Laixiang Shan1, 3, Zheng Qin2, 3, Shengnan Li1, 3, Renwei Zhang2, Xiao Yang2
1The Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
2School of Software, Tsinghua University, Beijing 100084, China
3Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China


Abstract—The size of B¨uchi Automata(BA) is a key factor during converting Linear-Time Temporal Logic(LTL) formulae to BA in model checking. Most algorithms for generating BA from LTL formulas involved intermediate automata, degeneralization algorithm and simplification of the formulas, but size of BA and time of converting can be reduced further. In this paper, we present an improved Tableau-based algorithm, which converts LTL formulae to Transition-based B¨uchi Automata(TBA) more efficiently. The algorithm is geared towards being used in model checking in on-the-fly fashion. By attaching the satisfy information of [-formula on states and transitions, we can decide whether the sequences of the BA are acceptable by using only one acceptance condition set, not multiple ones. Binary Decision Diagrams(BDD) is used to describe BA and simplify formulae. A better data structure, syntax Directed Acyclic Graph(DAG), is adopted in the algorithm. The size of product BA and computational complexity can be reduced significantly by using on-the-fly degeneralization. The algorithm can expand the state nodes while detecting the validity of nodes, removing the invalid nodes and combining equivalent states and transitions. Compared with other recent conversion tools, the algorithm proposed in this paper runs faster, with the smaller size of BA.

Index Terms—B¨uchi Automata, Linear-Time Temporal Logic, Binary Decision Diagrams, Transition-based B¨uchi Automata

[PDF]

Cite: Laixiang Shan, Zheng Qin, Shengnan Li, Renwei Zhang, Xiao Yang, "Conversion Algorithm of Linear-Time Temporal Logic to B¨uchi Automata," Journal of Software vol. 9, no. 4, pp. 970-976, 2014.

General Information

ISSN: 1796-217X
Frequency: Monthly
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Yoyo Y. Zhou
Abstracting/ Indexing: DBLP, EBSCO, ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jsw@iap.org
  • Sep 21, 2018 News!

    Papers published in JSW Vol. 13, No. 1- Vol. 13 No. 8 have been indexed by DBLP.    [Click]

  • Aug 24, 2018 News!

    Vol.12, No.8- Vol.13, No.5 has been indexed by EI (Inspec).   [Click]

  • Aug 01, 2018 News!

    [CFP] 2018 the annual meeting of JSW Editorial Board, ICSTE 2018, will be held in Kuala Lumpur, Malaysia, October 27-29, 2018.   [Click]

  • Sep 29, 2018 News!

    The papers published in Vol.13, No. 9 have all received dois from Crossref. 

  • Sep 21, 2018 News!

    Vol 13, No. 9 has been published with online version 4 original aritcles from 3 countries are published in this issue.     [Click]