Environment assumptions for synthesis

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

Volumn 5201 LNCS, Issue , 2008, Pages 147-161

  Chatterjee, Krishnendu ^b   Henzinger, Thomas A ^a   Jobstmann, Barbara ^a  

^a EPFL   (Switzerland)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING; GAME GRAPHS; LIVENESS; PROBABILISTIC GAMES; REALIZABILITY; STEP ALGORITHMS; SYNTHESIS PROBLEMS;

BOOLEAN FUNCTIONS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; SET THEORY; SPECIFICATIONS;

GAME THEORY;

EID: 54349101340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_14     Document Type: Conference Paper

References (21)

1. Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distributed Computing 2, 117-126 (1987)
2. Beer, I., Ben-David, S., Eisner, U., Rodeh, Y.: Efficient detection of vacuity in ACTL formulas. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 279-290. Springer, Heidelberg (1997)
3. Bernet, J., Janin, D., Walukiewicz, I.: Permissive strategies: from parity games to safety games. Theoretical Informatics and Applications, 261-275 (2002)
4. Beyer, D., Henzinger, T.A., Singh, V.: Algorithms for interface synthesis. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 4-19. Springer, Heidelberg (2007)
5. Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Automatic hardware synthesis from specifications: A case study. In: DATE 2007, pp. 1188-1193. ACM, New York (2007)
6. Bobaru, M.G., Pasareanu, C., Giannakopoulou, D.: Automated assume-guarantee reasoning by abstraction refinement. In: CAV 2008. LNCS. Springer, Heidelberg (accepted for publication, 2008)
7. Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Environment assumptions for synthesis. CoRR, abs/0805.4167 (2008)
8. Chatterjee, K., Henzinger, T.A., Jurdziński, M.: Games with secure equilibria. Theoretical Computer Science 365, 67-82 (2006)
9. Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.)CSL 2003. LNCS, vol. 2803, pp. 100-113. Springer, Heidelberg (2003)
10. Emerson, E.A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368-377. IEEE, Los Alamitos (1991)
11. Faella, M.: Games you cannot win. In: Workshop on Games and Automata for Synthesis and Validation, Lausanne, Switzerland (2007)
12. Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: FMCAD 2006, pp. 117-124. IEEE, Los Alamitos (2006)
13. King, V., Kupferman, O., Vardi, M.Y.: On the complexity of parity word automata. In: FOSSACS 2006, pp. 276-286. Springer, Heidelberg (2001)
14. Kupferman, O., Vardi, M.Y.: Vacuity detection in temporal model checking. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 82-96. Springer, Heidelberg (1999)
15. Martin, D.A.: Borel determinacy. Annals of Mathematics, pp. 363-371 (1975)
16. Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. In: LICS 2006, pp. 255-264. IEEE, Los Alamitos (2006)
17. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL 1989, pp. 179-190. ACM, New York (1989)
18. Rosner, R.: Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science (1992)
19. Specman elite - testbench automation, http://www.verisity.com/products/ specman.html
20. Vardi, M., Wolper, P.: Reasoning about infinite computations. Information and Computation, 1-37 (1994)
21. Vera - testbench automation, http://www.synopsys.com/products/vera/vera. html