Optimizations for LTL synthesis

Proceedings of Formal Methods in Computer Aided Design, FMCAD 2006

Volumn , Issue , 2006, Pages 117-124

  Jobstmann, Barbara ^a   Bloem, Roderick ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TIME LOGIC; OPTIMIZATION TECHNIQUES; SIMULATION BASED OPTIMIZATION;

APPROXIMATION ALGORITHMS; AUTOMATA THEORY; COMPUTER SIMULATION; OPTIMIZATION; SPECIFICATIONS;

FORMAL LOGIC;

EID: 34547394959     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2006.22     Document Type: Conference Paper

References (20)

1. O. Kupferman and M. Vardi, "Safraless decision procedures," in Symposium on Foundations of Computer Science (FOCS'05), 2005, pp. 531-542.
2. A. Pnueli and R. Rosner, "On the synthesis of a reactive module," in Proc. Symposium on Principles of Programming Languages (POPL '89), 1989, pp. 179-190.
3. R. Rosner, "Modular synthesis of reactive systems," Ph.D. dissertation, Weizmann Institute of Science, 1992.
4. S. Safra, "On the complexity of ω-automata," in Symposium on Foundations of Computer Science, Oct. 1988, pp. 319-327.
5. M. Vardi, "A game-theoretic approach to automated program generation," 2005, Presentation at IFIP Working Group 2.11 Second Meeting. Available from http://www.cs.rice.edu/taha/wg2.11/m-2/.
6. F. Somenzi and R. Bloem, "Efficient Büchi automata from LTL formulae," in Twelfth Conference on Computer Aided Verification (CAV'OO), E. A. Emerson and A. P. Sistla, Eds. Berlin: Springer-Verlag, July 2000, pp. 248-263, LNCS 1855.
7. N. Wallmeier, P. Hütten, and W. Thomas, "Symbolic synthesis of finite-state controllers for request-response specifications," in Proceedings of the International Conference on the Implementation and Application of Automata. Springer-Verlag, 2003.
8. A. Harding, M. Ryan, and P. Schobbens, "A new algorithm for strategy synthesis in LTL games," in Tools and Algorithms for the Construction and the Analysis of Systems (TACAS'05), 2005, pp. 477-492.
9. N. Piterman, A. Pnueli, and Y. Sa'ar, "Synthesis of reactive(1) designs," in Proc. Verification, Model Checking, and Abstract Interpretation (VMCAI'06), 2006, pp. 364-380.
10. E. M. Clarke, O. Grumberg, and D. A. Peled, Model Checking. Cambridge, MA: MIT Press, 1999.
11. R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi, "Alternating refinement relations," in Proc. 9th Conferance on Concurrency Theory. Nice: Springer-Verlag, Sept. 1998, pp. 163-178, LNCS 1466.
12. C. Fritz and T. Wilke, "State space reductions for alternating Büchi automata," in Foundations of Software Technology and Theoretical Computer Science. Kanpur, India: Springer-Verlag, Dec. 2002, pp. 157-168, LNCS 2556.
13. S. Gurumurthy, O. Kupferman, F. Somenzi, and M. Y Vardi, "On complementing nondeterministic Büchi automata," in Correct Hardware Design and Verification Methods (CHARME'03). Berlin: Springer-Verlag, Oct. 2003, pp. 96-110, LNCS 2860.
14. P. Wolper, M. Y. Vardi, and A. P. Sistla, "Reasoning about infinite computation paths," in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, 1983, pp. 185-194.
15. N. Piterman, "From nondeterministic Büchi and Streett automata to deterministic parity automata," in 21st Symposium on Logic in Computer Science (LICS'06), 2006, To appear.
16. S. Miyano and T. Hayashi, "Alternating finite automata on ω-words," Theoretical Computer Science, vol. 32, pp. 321-330, 1984.
17. C. Fritz, "Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata," in Conference on Implementation and Application of Automata (CIAA'03), O. H. Ibarra and Z. Dang, Eds., 2003, pp. 35-48, LNCS 2759.
18. W. Thomas, "On the synthesis of strategies in infinite games," in Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science. Springer-Verlag, 1995, pp. 1-13, LNCS 900.
19. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979.
20. S. Gurumurthy, R. Bloem, and F. Somenzi, "Fair simulation minimization," in Fourteenth Conference on Computer Aided Verification (CAV'02), E. Brinksma and K. G. Larsen, Eds. Berlin: Springer-Verlag, July 2002, pp. 610-623, LNCS 2404.