Fast Translation from LTL to Büchi Automata via Non-transition-based Automata-Reference-Cited by-同舟云学术

Fast Translation from LTL to Büchi Automata via Non-transition-based Automata

Published:2014 Issue: Volume: Page:364-379
ISSN:0302-9743
Container-title:Formal Methods and Software Engineering
language:
Short-container-title:

Author:

Mochizuki Shohei,Shimakawa Masaya,Hagihara Shigeki,Yonezaki Naoki

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-11737-9_24

Reference15 articles.

1. Lecture Notes in Computer Science;M. Abadi,1989

2. Aoshima, T., Sakuma, K., Yonezaki, N.: An efficient verification procedure supporting evolution of reactive system specifications. In: Proc. of the 4th International Workshop on Principles of Software Evolution, pp. 182–185. ACM (2001)

3. Aoshima, T., Yonezaki, N.: Verification of reactive system specification with outer event conditional formula. In: International Symposium on Principles of Software Evolution (ISPSE2000), pp. 195–199 (2000)

4. Lecture Notes in Computer Science;T. Babiak,2012

5. Duret-Lutz, A.: LTL translation improvements in Spot. In: Proc. of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems, VECoS 2011, pp. 72–83. British Computer Society (2011)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automata-Based Software Model Checking of Hyperproperties;Lecture Notes in Computer Science;2023

2. Towards Efficient Implementation of Realizability Checking for Reactive System Specifications;Proceedings of the 2019 8th International Conference on Software and Computer Applications;2019-02-19

3. Reducing Bounded Realizability Analysis to Reachability Checking;Lecture Notes in Computer Science;2015