Optimizing büchi automata

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

Volumn 1877 LNCS, Issue , 2000, Pages 153-168

  Etessami, Kousha ^a   Holzmann, Gerard J ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; TEMPORAL LOGIC; AUTOMATA THEORY;

EXPLICIT-STATE MODEL CHECKING; FAIR SIMULATION; LINEAR TEMPORAL LOGIC; RUNNING TIME; TEMPORAL FORMULAE; WEB SERVERS;

AUTOMATA THEORY; MODEL CHECKING;

EID: 84885232935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_13     Document Type: Conference Paper

References (20)

1. M. Daniele, F. Giunchiglia, and M. Y. Vardi. Improved automata generation for linear temporal logic. In Proc. of 11th Int. Conf. on Computer Aided Verification (CAV99), number 1633 in LNCS, pages 249-260, 1999.
2. D. L. Dill, A. J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In Proceedings of CAV'91, pages 329-341, 1991.
3. E. A. Emerson. Temporal and modal logics. In J. van Leeuwen, editor, Handbook of Theo. Comp. Sci., Volume B, pages 995-1072. Elsevier, 1990.
4. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York, 1972.
5. K. Etessami. Stutter-invariant languages, ω-automata, and temporal logic. In Proceedings of the 11th International Conference on Computer Aided Verification, pages 236-248, 1999.
6. 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, 1995.
7. M. Henzinger, T. Henzinger, and P. Kopke. Computing simulations on finite and infinite graphs. In Proc. of 36th IEEE Symp. on Foundations of Comp. Sci. (FOCS'95), pages 453-462, 1995.
8. T. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In Proc. of 9th Int. Conf. on Concurrency Theory (CONCUR'97), number 1243 in LNCS, pages 273-287, 1997.
9. G. J. Holzmann. The model checker spin. IEEE Transactions on Software Engineering, 23(5): 279-295, 1997.
10. G. J. Holzmann and D. Peled. An improvement in formal verification. In 7th Int. Conf. on Formal Description Techniques, pages 177-194, 1994.
11. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Formal Languages and Computation. Addison-Wesley, 1979.
12. D. Kozen. Lower bounds for natural proof systems. In 18th IEEE Symposium on Foundations of Computer Science, pages 254-266, 1977.
13. P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1): 43-68, 1990.
14. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Volume 1. Springer-Verlag, Berlin/New York, 1992.
15. F. Somenzi and R. Bloem. Efficient büchi automata from ltl formulae. In Proceedings of 12th Int. Conf. on Computer Aided Verification, 2000.
16. L. Stockmeyer and A. R. Meyer. Word problems requiring exponential time: preliminary report. In Proceedings of 5th ACM Symposium on Theory of Computing, pages 1-9, 1973.
17. SPIN workshop on theo. aspects of model checking, July 1999. Trento, Italy.
18. H. Tauriainen. A randomized testbench for algorithms translating linear temporal logic formulae into büchi automata. In Workshop Concurrency, Specifications, and Programming, pages 251-262, Warsaw, Sept. 1999.
19. W. Thomas. Handbook of Theoretical Computer Science, volume B, chapter Automata on Infinite Objects, pages 133-191. MIT Press, 1990.
20. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Dexter Kozen, editor, First Annual IEEE Symposium on Logic in Computer Science (LICS), pages 322-331, 1986.