Generalized Rabin(1) synthesis with applications to robust system synthesis

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

Volumn 6617 LNCS, Issue , 2011, Pages 101-115

  Ehlers, Rüdiger ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC PROPERTIES; AUTOMATICALLY GENERATED; EFFICIENT IMPLEMENTATION; FINITE STATE MACHINES; FORMAL SPECIFICATION; LINEAR TIME TEMPORAL LOGIC; PROTOTYPE IMPLEMENTATIONS; REACTIVE SYSTEM; ROBUST SYNTHESIS; ROBUST SYSTEMS;

NASA; PROGRAM DEBUGGING; SPECIFICATIONS; TEMPORAL LOGIC;

FORMAL METHODS;

EID: 79955044457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20398-5_9     Document Type: Conference Paper

References (26)

1. Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S.: Mocha: Modularity in model checking. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 521-525. Springer, Heidelberg (1998)
2. Alur, R., Madhusudan, P., Nam, W.: Symbolic computational techniques for solving games. STTT 7(2), 118-128 (2005)
3. Arora, A., Gouda, M.G.: Closure and convergence: A foundation of fault-tolerant computing. IEEE Trans. Software Eng. 19(11), 1015-1027 (1993)
4. Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T.A., Jobstmann, B.: Robustness in the presence of liveness. In: [24], pp. 410-424
5. Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Interactive presentation: Automatic hardware synthesis from specifications: a case study. In: Lauwereins, R., Madsen, J. (eds.) DATE, pp. 1188-1193. ACM, New York (2007) (Pubitemid 47334121)
6. Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Specify, compile, run: Hardware from PSL. Electr. Notes Theor. Comput. Sci. 190(4), 3-16 (2007)
7. Bloem, R., Greimel, K., Henzinger, T.A., Jobstmann, B.: Synthesizing robust systems. In: FMCAD, pp. 85-92. IEEE, Los Alamitos (2009)
8. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers 35(8), 677-691 (1986)
9. Chatterjee, K., Henzinger, T.A., Horn, F.: Finitary winning in omega-regular games. ACM Trans. Comput. Log. 11(1) (2009)
10. de Alfaro, L., Faella, M.: An accelerated algorithm 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)
11. Dimitrova, R., Finkbeiner, B.: Synthesis of Fault-Tolerant Distributed Systems. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 321-336. Springer, Heidelberg (2009)
12. Ehlers, R.: Symbolic bounded synthesis. In: [24], pp. 365-379
13. Ehlers, R.: Generalised Rabin(1) synthesis. arXiv/CoRR abs/1003.1684 (2010)
14. Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy (extended abstract). In: FOCS, pp. 368-377. IEEE, Los Alamitos (1991)
15. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)
16. Klein, J., Baier, C.: Experiments with deterministic ω-automata for formulas of linear temporal logic. Theor. Comput. Sci. 363(2), 182-195 (2006)
17. Kress-Gazit, H., Fainekos, G.E., Pappas, G.J.: Temporal-logic-based reactive mission and motion planning. IEEE Transactions on Robotics 25(6), 1370-1381 (2009)
18. Krishnan, S.C., Puri, A., Brayton, R.K., Varaiya, P.: The Rabin index and chain automata, with applications to automatas and games. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 253-266. Springer, Heidelberg (1995)
19. McNaughton, R.: Infinite games played on finite graphs. Ann. Pure Appl. Logic 65(2), 149-184 (1993)
20. Piterman, N., Pnueli, A., Sa'ar, 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)
21. Safra, S.: Complexity of Automata on Infinite Objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel (March 1989)
22. Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 133-191. MIT Press, Cambridge (1994)
23. Thomas, W.: Church's problem and a tour through automata theory. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol. 4800, pp. 635-655. Springer, Heidelberg (2008)
24. Touili, T., Cook, B., Jackson, P. (eds.): CAV2010. LNCS, vol. 6174. Springer, Heidelberg(2010)
25. Wongpiromsarn, T., Topcu, U., Murray, R.M.: Automatic synthesis of robust embedded control software. In: AAAI Spring Symposium on Embedded Reasoning (2010)
26. Wongpiromsarn, T., Topcu, U., Murray, R.M.: Receding horizon control for temporal logic specifications. In: Johansson, K.H., Yi, W. (eds.) HSCC, pp. 101-110. ACM, New York (2010)