ISCAS OpenIR
LTL satisfiability checking revisited
Li, Jianwen (1); Zhang, Lijun (2); Pu, Geguang (1); Vardi, Moshe Y. (3); He, Jifeng (1)
2013
Conference Name20th International Symposium on Temporal Representation and Reasoning, TIME 2013
Pages91-98
Conference DateSeptember 26, 2013 - September 28, 2013
Conference PlacePensacola, FL, United states
Indexed TypeEI
Publish PlaceInstitute of Electrical and Electronics Engineers Inc.
ISBN9780769551128
Department(1) Software Engineering, East China Normal University, China; (2) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (3) Computer Science, Rice University, United States
English AbstractWe propose a novel algorithm for the satisfiability problem for Linear Temporal Logic (LTL). Existing approaches first transform the LTL formula into a B'uchi automaton and then perform an emptiness checking of the resulting automaton. Instead, our approach works on-the-fly by inspecting the formula directly, thus enabling finding a satisfying model quickly without constructing the full automaton. This makes our algorithm particularly fast for satisfiable formulas. We report on a prototype implementation, showing that our approach significantly outperforms state-of-the-art tools. © 2013 IEEE.; We propose a novel algorithm for the satisfiability problem for Linear Temporal Logic (LTL). Existing approaches first transform the LTL formula into a B'uchi automaton and then perform an emptiness checking of the resulting automaton. Instead, our approach works on-the-fly by inspecting the formula directly, thus enabling finding a satisfying model quickly without constructing the full automaton. This makes our algorithm particularly fast for satisfiable formulas. We report on a prototype implementation, showing that our approach significantly outperforms state-of-the-art tools. © 2013 IEEE.
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/16685
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Li, Jianwen ,Zhang, Lijun ,Pu, Geguang ,et al. LTL satisfiability checking revisited[C]. Institute of Electrical and Electronics Engineers Inc.,2013:91-98.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li, Jianwen (1)]'s Articles
[Zhang, Lijun (2)]'s Articles
[Pu, Geguang (1)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li, Jianwen (1)]'s Articles
[Zhang, Lijun (2)]'s Articles
[Pu, Geguang (1)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li, Jianwen (1)]'s Articles
[Zhang, Lijun (2)]'s Articles
[Pu, Geguang (1)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.