Efficient Büchi automata from LTL formulae

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1855, Issue , 2000, Pages 248-263

  Somenzi, Fabio ^a   Bloem, Roderick ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; HEURISTIC METHODS; MODEL CHECKING; OPTIMIZATION;

HEURISTIC APPROACH; LINEAR TIME LOGIC; LTL FORMULAE; NUMBER AND SIZE; NUMBER OF STATE; SIMPLIFICATION ALGORITHMS; THREE PHASIS; TRANSLATION PROCEDURES;

TEMPORAL LOGIC;

EID: 84944388557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_21     Document Type: Conference Paper

References (18)

1. A. Aziz, V. Singhal, G. M. Swamy, and R. K. Brayton. Minimizing interacting finite state machines. In Proceedings of the International Conference on Computer Design, pages 255–261, Cambridge, MA, October 1994.
2. R. Bloem, K. Ravi, and F. Somenzi. Efficient decision procedures for model checking of linear time logic properties. In N. Halbwachs and D. Peled, editors, Eleventh Conference on Computer Aided Verification (CAV’99), pages 222–235. Springer-Verlag, Berlin, 1999. LNCS 1633.
3. R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. Sangiovanni-Vincentelli. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, Boston, Massachusetts, 1984.
4. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98:142–170, 1992.
5. M. Daniele, F. Giunchiglia, and M.Y. Vardi. Improved automata generation for linear time temporal logic. In N. Halbwachs and D. Peled, editors, Eleventh Conference on Computer Aided Verification (CAV’99), pages 249–260. Springer-Verlag, Berlin, 1999. LNCS 1633.
6. D. L. Dill, A. J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In K. G. Larsen and A. Skou, editors, Third Workshop on Computer Aided Verification (CAV’91), pages 255–265. Springer, Berlin, July 1991. LNCS 575.
7. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proceedings of the First Annual Symposium of Logic in Computer Science, pages 267–278, June 1986.
8. K. Etessami and G. Holzmann. Optimizing Büchi automata. Submitted for publication, 2000.
9. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Protocol Specification, Testing, and Verification, pages 3–18. Chapman & Hall, 1995.
10. A. Grasselli and F. Luccio. A method for minimizing the number of internal states in incompletely specified sequential networks. IEEE Transactions on Electronic Computers, EC-14(3):350–359, June 1965.
11. Y. Kesten, Z. Manna, H. McGuire, and A. Pnueli. Checking that finite-state concurrent programs satisfy their linear specification. In Proceedings of the 11th ACM Symposium on Principles of Programming Languages, pages 97–107, 1984.
12. Y. Kesten, A. Pnueli, and L.-o. Raviv. Algorithmic verification of linear temporal logic specifications. In International Colloquium on Automata, Languages, and Programming (ICALP-98), pages 1–16, Berlin, 1998. Springer. LNCS 1443.
13. O. Kupferman and M. Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. 13th IEEE Symposium on Logic in Computer Science, June 1998.
14. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, New Orleans, January 1985.
15. E. J. McCluskey. Minimization of boolean functions. Bell Syst. Technical Journal, 35:1417–1444, November 1956.
16. R. Milner. An algebraic definition of simulation between programs. Proc. 2nd Int. Joint Conf. on Artificial Intelligence, pages 481–489, 1971.
17. R. S. Raimi. Environment Modeling and Efficient State Reachability Checking. PhD thesis, University of Texas at Austin, 1999.
18. P. Wolper, M. Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In Proceedings of the 24th IEEE Symposyium on Foundations of Computer Science, pages 185–194, 1983.