Larger Automata and Less Work for LTL Model Checking-Reference-Cited by-同舟云学术

Larger Automata and Less Work for LTL Model Checking

Published:2006 Issue: Volume: Page:53-70
ISSN:0302-9743
Container-title:Model Checking Software
language:
Short-container-title:

Author:

Geldenhuys Jaco,Hansen Henri

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11691617_4

Reference37 articles.

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

2. Lecture Notes in Computer Science;L. Brim,2001

3. Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Math. 6, 66–92 (1960)

4. Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proc. 1960 Intl. Congr. Logic, Method and Philosophy of Science, pp. 1–11. Stanford Univ. Press (June 1962)

5. Choueka, Y.: Theories of automata on ω-tapes: a simplified approach. Journal Computer and System Sciences 8, 117–141 (1974)

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

1. From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata;International Journal on Software Tools for Technology Transfer;2022-07-23

2. A Unified Translation of Linear Temporal Logic to ω-Automata;Journal of the ACM;2020-11-16

3. New Optimizations and Heuristics for Determinization of Büchi Automata;Automated Technology for Verification and Analysis;2019

4. Self-adaptive Model Checking, the Next Step?;Application and Theory of Petri Nets and Concurrency;2018

5. Limit-Deterministic Büchi Automata for Linear Temporal Logic;Computer Aided Verification;2016