Minimizing generalized Büchi automata

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

Volumn 4144 LNCS, Issue , 2006, Pages 45-58

  Juvekar, Sudeep ^a   Piterman, Nir ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; PROBLEM SOLVING;

DELAYED SIMULATION MINIMIZATION; FAIR SIMULATION MINIMIZATION; MULTIPLE ACCEPTANCE; MULTIPLE ACCEPTANCE CONDITIONS;

AUTOMATA THEORY;

EID: 33749852731     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_7     Document Type: Conference Paper

References (30)

1. [AFF+02] R. Armoni, L. Fix, A. Flaisher, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, E. Singerman, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. Thi: ForSpec temporal logic: A new temporal property-specification logic. In 8th TACAS, LNCS2280, pp. 296-211, 2002.
2. [BCC+99] A. Biere, A. Cimaili, E.M. Clarke, M. Fujita. and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In 36th DAC, pp. 317-320. IEEE, 1999.
3. [BLMOl] P. Biesse, T. Leonard, and A. Mokkedem. Finding bugs in an alpha microprocessors using satisfiability solvers. In 13th CAV, LNCS 2102, pp. 454-464. 2001.
4. [CFF+01] F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M.Y. Vardi. Benefits of bounded model checking at an industrial setting. In 13th CAV, LNCS 2102, pp. 436-453. Springer-Verlag, 2001.
5. [CGP99] E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
6. [Cho74] Y. Choueka. Theories of automata on ω-tapes: A simplified approach. JCSS, 8:117-141, 1974.
7. [CVWY92] C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. FMSD, 1:275-288, 1992.
8. [DHW91] D.L. Dill, A.J. Hu, and H. Wong-Toi. Checking for language inclusion using simulation relations. In 3rd CAV, LNCS 575, pp. 255-265. Springer-Verlag, 1991.
9. [EH00] K. Etessami and G. Holzmann. Optimizing büchi automata. In 11th Concur, LNCS 1877, pp. 153-167. Springer-Verlag, 2000.
10. [EJ9I] E.A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In Proc. 32nd FOCS, pp. 368-377, 1991.
11. [Eme90] E.A. Emerson. Temporal and modal logic. In Handbook ofTCS, 1990.
12. [EWS01] K. Etessami, Th. Wilke, and R. A. Schuller. Fair simulation relations, parity games, and state space reduction for Büchi automata. In 28th ICALP, LNCS 2076, 2001.
13. [GBS02] S. Gurumurthy, R. Bloem, and F. Somenzi. Fair simulation minimization. In 14th CAV, LNCS 2404, pp. 610-623. Springer-Verlag, 2002.
14. [GH82] Y. Gurevich and L. Harrington. Trees, automata, and games. In 14th STOC, 1982.
15. [GL94] O. Grumberg and D.E. Long. Model checking and modular verification. ACM TOPLAS, 16(3):843-871, 1994.
16. [GO01] P. Gastin and D. Oddoux. Fast LTL to büchi automata translation. In 13th CAV, LNCS 2102, pp. 53-65. Springer-Verlag, 2001.
17. [GPVW95] R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In PSTV, pp. 3-18, 1995.
18. [HKR97] T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In 8th Concur, LNCS 1243, pp. 273-287. Springer-Verlag, 1997.
19. [IEE05] IEEE. IEEE standard for property specification language (PSL), October 2005.
20. [Jur00] M. JurzifiSki. Small progress measures for solving parity games. In 17th STAGS, LNCS 1770, pp. 290-301. Springer-Verlag, 2000.
21. [KPP05] Y. Kesten, N. Piterman, and A. Pnueli. Bridging the gap between fair simulation and trace containment. IC, 200(1 ):35-61, 2005.
22. [KPV06] O. Kupferman, N. Piterman, and M.Y. Vardi. Safraless compositional synthesis. In 18th CAV, LNCS. Springer-Verlag, 2006.
23. [KV04] O. Kupferman and M.Y. Vardi. From complementation to certification. In 10th TACAS, LNCS 2988, pp. 591-606. Springer-Verlag, 2004.
24. [McM93] K.L. McMillan. Symbolic Model Checking. Kluwer, 1993.
25. [Mi171] R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd International Joint Conference on Artificial Intelligence, pp. 481-489. 1971.
26. [Pnu77] A. Pnueli. The temporal logic of programs. In 18th FOCS, pages 46-57, 1977.
27. [SB00] F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In 12th CAV, LNCS 1855, pp. 248-263. Springer-Verlag, 2000.
28. [Str82] R.S. Streett. Propositional dynamic logic of looping and converse. IC, 54, 1982.
29. [Var96] M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, LNCS 1043, Springer-Verlag, 1996.
30. [VW94] M.Y. Vardi and P. Wolper. Reasoning about infinite computations. IC, 115(1), 1994.