Specification-centered robustness

SIES 2011 - 6th IEEE International Symposium on Industrial Embedded Systems, Conference Proceedings

Volumn , Issue , 2011, Pages 176-185

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

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^c NXP SEMICONDUCTORS   (Netherlands)

^d VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE NUMBER; INFINITE NUMBERS; LIVENESS; LIVENESS CONSTRAINTS; REACTIVE SYSTEM;

EMBEDDED SYSTEMS;

SPECIFICATIONS;

EID: 80052012679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIES.2011.5953660     Document Type: Conference Paper

References (34)

1. B. Alpern and F. B. Schneider. Defining liveness. Information Processing Letters, 21:181-185, October 1985.
2. R. Alur, A. Kanade, and G. Weiss. Ranking automata and games for prioritized requirements. In Computer Aided Verification, pages 240- 253, 2008.
3. A. Arora. Closure and convergence: A foundation of fault-tolerant computing. IEEE Transatcions of Software Engineering, 19:1015-1027, 1993.
4. P. Attie, A. Arora, and E. A. Emerson. Synthesis of fault-tolerant concurrent programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 26:125-185, 2004.
5. A. Avizienis, J.-C. Laprie, B. Randell, and C. E. Landwehr. Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. Dependable Sec. Comput., 1(1):11-33, 2004. (Pubitemid 40134576)
6. R Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann. Robustness in the presence of liveness. In CAV, pages 410-424, 2010.
7. R. Bloem, K. Chatterjee, T. Henzinger, and B. Jobstmann. Better quality in synthesis through quantitative objectives. In Int. Conf. Computer Aided Verification (CAV), pages 140-156, 2009.
8. 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, pages 1188-1193, 2007. (Pubitemid 47334121)
9. R. Bloem, K. Greimel, T. Henzinger, and B. Jobstmann. Synthesizing robust systems. In Proc. Formal Methods in Computer Aided Design (FMCAD), pages 85-92, 2009.
10. K. Chatterjee, T. Henzinger, and B. Jobstmann. Environment assumptions for synthesis. In International Conference on Concurrency Theory (CONCUR), pages 147-161, 2008.
11. C.-H. Cheng, H. Rueß, A. Knoll, and C. Buckl. Synthesis of faulttolerant embedded systems using games: From theory to practice. In VMCAI, pages 118-133, 2011.
12. E. W. Dijkstra. Cooperating sequential processes. In Genuys, editor, Programming Languages, pages 43-112. Academic Press, 1968.
13. E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17:643-644, 1974.
14. L. Doyen, T. A. Henzinger, A. Legay, and D. Nickovic. Robustness of sequential circuits. In 10th International Conference on Application of Concurrency to System Design, ACSD 2010, pages 77-84, 2010.
15. D. D'Souza and M. Gopinathan. Conflict-tolerant features. In Computer Aided Verification (CAV), pages 227-239, 2008.
16. A. Ebnenasir, S. S. Kulkarni, and A. Arora. Ftsyn: a framework for automatic synthesis of fault-tolerance. Software Tools for Technology Transfer, 10:455-471, 2008.
17. C. Eisner. Using symbolic model checking to verify the railway stations of Hoorn-Kersenboogerd and Heerhugowaard. In Correct Hardware Design and Verification Methods (CHARME'99), pages 97-109, Bad Herrenalb, September 1999. Springer-Verlag. LNCS 1703.
18. M. Faella. Games you cannot win. In Workshop on Games and Automata for Synthesis and Validation, 2007.
19. G. Fey and R. Drechsler. A basis for formal robustness checking. In ISQED, pages 784-789, 2008.
20. F. C. Gärtner. Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Comput. Surv., 31(1):1-26, 1999.
21. C. Ghezzi, M. Jazayeri, and D. Mandrioli. Fundamentals of Software Engineering. Prentice-Hall, 1991.
22. A. Girault and É. Rutten. Automating the addition of fault tolerance with discrete controller synthesis. Formal Methods in System Design, 35(2):190-225, 2009.
23. T. Henzinger. Two challenges in embedded systems design: Predictability and robustness. Philosophical Transactions of the Royal Society, 2008.
24. B. Jobstmann and R. Bloem. Optimizations for LTL synthesis. In 6th Conference on Formal Methods in Computer Aided Design (FMCAD' 06), pages 117-124, 2006. (Pubitemid 47159932)
25. B. Jobstmann, S. Galler, M. Weiglhofer, and R. Bloem. Anzu: A tool for property synthesis. In Computer Aided Verification, pages 258-262, 2007.
26. S. Juvekar and N. Piterman. Minimizing generalized büchi automata. In CAV, pages 45-58, 2006.
27. S. S. Kulkarni and A. Ebnnenasir. Complexity issues in automated synthesis of failsafe fault-tolerance. IEEE Transactions on Dependable and Secure Computing, 2:1-15, 2005.
28. N. Piterman and A. Pnueli. Faster solutions of rabin and streett games. In LICS, pages 275-284, 2006. (Pubitemid 47130373)
29. N. Piterman, A. Pnueli, and Y. Saár. Synthesis of reactive(1) designs. In 7th International Conference on Verification, Model Checking and Abstract Interpretation, pages 364-380. Springer, 2006. LNCS 3855. (Pubitemid 43973678)
30. A. Pnueli. The temporal logic of programs. In IEEE Symposium on Foundations of Computer Science, pages 46-57, Providence, RI, 1977.
31. P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77:81-98, 1989.
32. M. C. Rinard. Acceptability-oriented computing. In OOPSLA Companion, pages 221-239, 2003.
33. W. Thomas. Infinite games and verification. In Fourteenth Conference on Computer Aided Verification (CAV'02), pages 58-64. Springer-Verlag, 2002. LNCS 2404.
34. C. von Essen and B. Jobstmann. Synthesizing systems with optimal average-case behavior for ratio objectives. In International Workshop on Interactions, Games and Protocols (iWIGP), pages 17-32, 2011.