Safety first: A two-stage algorithm for LTL games

9th International Conference Formal Methods in Computer Aided Design, FMCAD 2009

Volumn , Issue , 2009, Pages 77-84

  Sohail, Saqib ^a   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCEPTANCE CONDITIONS; LINEAR-TIME PROPERTIES; LTL GAMES; PARITY GAMES; REACTIVE SYSTEM; SPEED-UPS; TWO STAGE; TWO-STAGE ALGORITHM; WINNING STRATEGY;

COMPUTER AIDED DESIGN; SPECIFICATIONS;

FORMAL METHODS;

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

References (33)

1. 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.
2. N. Piterman, "From nondeterministic Büchi and Streett automata to deterministic parity automata," in 21st Symposium on Logic in Computer Science, Seattle, WA, Aug. 2006, pp. 255-264.
3. N. Piterman, A. Pnueli, and Y. Sáar, "Synthesis of reactive(1) designs," in 7th International Conference on Verification, Model Checking and Abstract Interpretation. Springer, 2006, pp. 364-380, LNCS 3855.
4. O. Kupferman and M. Y. Vardi, "Safraless decision procedures," in Foundations of Computer Science, Pittsburgh, PA, Oct. 2005, pp. 531-542.
5. O. Kupferman, N. Piterman, and M. Y. Vardi, "Safraless compositional synthesis," in Eighteenth Conference on Computer Aided Verification, 2006, pp. 31-44, LNCS 4144.
6. T. A. Henzinger and N. Piterman, "Solving games without determiniza-tion," in 15th Conference on Computer Science Logic, Szeged, Hungary, Sep. 2006, pp. 394-409, LNCS 4207.
7. S. Sohail, F. Somenzi, and K. Ravi, "A hybrid algorithm for LTL games," in Verification, Model Checking and Abstract Interpretation, San Francisco, CA, Jan. 2008, pp. 309-323, LNCS 4905.
8. M. Jurdziński, "Small progress measures for solving parity games," in STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science. Lille, France: Springer, Feb. 2000, pp. 290-301, LNCS 1770.
9. K. Chatterjee, T. A. Henzinger, and N. Piterman, "Generalized parity games," in 10th International Conference on Foundations of Software Science and Computation Structures. Springer, 2007, pp. 153-167, LNCS 4423.
10. J. R. Büchi, "On a decision method in restricted second order arithmetic," in Proceedings of the 1960 International Congress on Logic, Methodology, and Philosophy of Science. Stanford University Press, 1962, pp. 1-11.
11. A. W. Mostowski, "Regular expressions for infinite trees and a standard form of automata," in Computation Theory, A. Skowron, Ed. SpringerVerlag, 1984, pp. 157-168, LNCS 208.
12. E. A. Emerson and C. S. Jutla, "Tree automata, mu-calculus and deter-minacy," in Proc. 32nd IEEE Symposium on Foundations of Computer Science, Oct. 1991, pp. 368-377.
13. B. Alpern and F. B. Schneider, "Defining liveness," Information Processing Letters, vol. 21, pp. 181-185, Oct. 1985.
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. 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, Jan. 1985, pp. 97-107.
16. 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. Chapman & Hall, 1995, pp. 3-18.
17. A. P. Sistla, "Safety, liveness and fairness in temporal logic," Fo r m a l Aspects in Computing, vol. 6, pp. 495-511, 1994.
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. D. A. Martin, "Borel determinacy," Annals of Mathematics, vol. second series, 102, pp. 363-371, 1975.
20. W. Zielonka, "Infinite games on finitely coloured graphs with applications to automata on infinite trees," Theoretical Computer Science, vol. 200, no. 1-2, pp. 135-183, 1998.
21. F. Horn, "Streett games on finite graphs," in Workshop on Games in Design and Verification, Edimburgh, UK, Jul. 2005.
22. M. Jurdziński, M. Paterson, and U. Zwick, "A deterministic subexponen-tial algorithm for solving parity games," in Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, FL, Jan. 2006, pp. 117-123.
23. Z. Manna and A. Pnueli, "A hierarchy of temporal properties," in Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, Aug. 1990, pp. 377-410.
24. L. H. Landweber, "Decision problems for ω-automata," Mathematical Systems Theory, vol. 3, no. 4, pp. 376-384, 1969.
25. B. Alpern and F. B. Schneider, "Recognizing safety and liveness," Distributed Computing, vol. 2, pp. 117-126, 1987.
26. O. Kupferman and M. Y. Vardi, "Model checking of safety properties," in Eleventh Conference on Computer Aided Verification (CAV'99), N. Halbwachs and D. Peled, Eds. Berlin: Springer-Verlag, 1999, pp. 172-183, LNCS 1633.
27. D. E. Muller, A. Saoudi, and P. Schupp, "Alternating automata, the weak monadic theory of trees and its complexity," Theorical Computer Science, vol. 97, pp. 233-244, 1992.
28. C. Löding and W. Thomas, "Alternating automata and logics over infinite words," in Theoretical Computer Science (TCS 2000). Berlin: SpringerVerlag, Aug. 2000, pp. 521-535, LNCS 1872.
29. J. Bernet, D. Janin, and I. Walukiewicz, "Permissive strategies: From parity games to safety games," RAIRO: Theoretical Informatics and Applications, vol. 36, no. 3, pp. 261-275, 2002.
30. F. Somenzi and R. Bloem, "Efficient Büchi automata from LTL formulae," in Twelfth Conference on Computer Aided Verification (CAV'00), E. A. Emerson and A. P. Sistla, Eds. Berlin: Springer-Verlag, Jul. 2000, pp. 248-263, LNCS 1855.
31. R. Bloem, S. Galler, B. Jobstmann, N. Piterman, A. Pnueli, and M. Weiglhofer, "Specify, compile, run: Hardware form PSL," in 6th International Workshop on Compiler Optimization Meets Compiler Verification, 2007, Electronic Notes in Theoretical Computer Science http://www.entcs.org/.
32. R. K. Brayton et al., "VIS: A system for verification and synthesis," in Eighth Conference on Computer Aided Verification (CAV'96), T. Hen-zinger and R. Alur, Eds. Rutgers University: Springer-Verlag, 1996, pp. 428-432, LNCS 1102.
33. R. Bloem, S. Galler, B. Jobstmann, N. Piterman, A. Pnueli, and M. Weiglhofer, "Automatic hardware synthesis from specifications: A case study," in In Proceedings of the Design, Automation and Test in Europe, 2007, pp. 1188-1193.