Robustness in the presence of liveness

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

Volumn 6174 LNCS, Issue , 2010, Pages 410-424

  Bloem, Roderick ^a   Chatterjee, Krishnendu ^b   Greimel, Karin ^a   Henzinger, Thomas A ^b   Jobstmann, Barbara ^c  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^c VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LIVENESS; ROBUST SYSTEMS;

COMPUTER AIDED ANALYSIS;

SPECIFICATIONS;

EID: 77954989666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14295-6_36     Document Type: Conference Paper

References (20)

1. Arora, A.: Closure and convergence: A foundation of fault-tolerant computing. IEEE Transatcions of Software Engineering 19, 1015-1027 (1993)
2. Alpern, B., Schneider, F.B.: Defining liveness. Information Processing Letters 21, 181-185 (1985) (Pubitemid 15580746)
3. Bloem, R., Chatterjee, K., Henzinger, T., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140-156. Springer, Heidelberg (2009)
4. Bloem, R., Greimel, K., Henzinger, T., Jobstmann, B.: Synthesizing robust systems. In: Proc. Formal Methods in Computer Aided Design (FMCAD), pp. 85-92 (2009)
5. Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Automatic hardware synthesis from specifications: A case study. In: Proceedings of the Design, Automation and Test in Europe, pp. 1188-1193 (2007)
6. Chatterjee, K., Henzinger, T.A., Piterman, N.: Generalized parity games. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 153-167. Springer, Heidelberg (2007)
7. de Alfaro, L., Faella, M.: Accelerated algorithms for 3-color parity games with an application to timed games. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 108-120. Springer, Heidelberg (2007)
8. Dijkstra, E.W.: Cooperating sequential processes. In: Genuys (ed.) Programming Languages, pp. 43-112. Academic Press, London (1968)
9. Dijkstra, E.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17, 643-644 (1974)
10. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proc. 32nd IEEE Symposium on Foundations of Computer Science, October 1991, pp. 368-377 (1991)
11. Ebnenasir, A., Kulkarni, S.S., Arora, A.: Ftsyn: a framework for automatic synthesis of fault-tolerance. Software Tools for Technology Transfer 10, 455-471 (2008)
12. Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional mu-calculus. In: Proceedings of the First Annual Symposium of Logic in Computer Science, June 1986, pp. 267-278 (1986)
13. Fey, G., Drechsler, R.: A basis for formal robustness checking. In: ISQED, pp. 784-789 (2008)
14. Greimel, K., Bloem, R., Jobstmann, B., Vardi, M.: Open implication. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 361-372. Springer, Heidelberg (2008)
15. Jobstmann, B., Galler, S., Weiglhofer, M., Bloem, R.: Anzu: A tool for property synthesis. In: Damm,W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 258-262. Springer, Heidelberg (2007)
16. Jurdziński, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290-301. Springer, Heidelberg (2000)
17. Kulkarni, S.S., Ebnnenasir, A.: Complexity issues in automated synthesis of failsafe fault-tolerance. IEEE Transactions on Dependable and Secure Computing 2, 1-15 (2005)
18. Piterman, N., Pnueli, A.: Faster solutions of Rabin and Streett games. In: Logic in Computer Science, pp. 275-284 (2006)
19. Piterman, N., Pnueli, A., Saár, Y.: Synthesis of reactive(1) designs. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 364-380. Springer, Heidelberg (2005)
20. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200(1-2), 135-183 (1998)