Symbolic bounded synthesis

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

Volumn 6174 LNCS, Issue , 2010, Pages 365-379

  Ehlers, Rüdiger ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE STATE SYSTEMS; LINEAR TIME TEMPORAL LOGIC; LOAD-BALANCING; NUMBER OF STATE; OPTIMISATIONS; ORDERS OF MAGNITUDE; STATE SPACE REPRESENTATION; SYMBOLIC DATA;

COMPUTER AIDED ANALYSIS; TEMPORAL LOGIC;

BINARY DECISION DIAGRAMS;

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

References (22)

1. Bloem, R., Cimatti, A., Pill, I., Roveri, M.: Symbolic implementation of alternating automata. International Journal of Foundations of Computer Science 18(4), 727-743 (2007)
2. 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)
3. Bozga, M., Maler, O., Pnueli, A., Yovine, S.: Some progress in the symbolic verification of timed automata. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 179-190. Springer, Heidelberg (1997)
4. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers 35(8), 677-691 (1986)
5. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Inf. Comput. 98(2), 142-170 (1992)
6. Cimatti, A., Clarke, E.M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: An opensource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359-364. Springer, Heidelberg (2002)
7. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)
8. Filiot, E., Jin, N., Raskin, J.F.: An antichain algorithm for LTL realizability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 263-277. Springer, Heidelberg (2009)
9. Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53-65. Springer, Heidelberg (2001)
10. Henzinger, T.A., Piterman, N.: Solving games without determinization. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 395-410. Springer, Heidelberg (2006)
11. Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: FMCAD, pp. 117-124. IEEE Computer Society, Los Alamitos (2006)
12. Kupferman, O., Lustig, Y., Vardi, M.: On locally checkable properties. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 302-316. Springer, Heidelberg (2006)
13. Kupferman, O., Vardi, M.Y.: Model checking of safety properties. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 172-183. Springer, Heidelberg (1999)
14. Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: FOCS, pp. 531-542. IEEE, Los Alamitos (2005)
15. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)
16. Müller, S.M., Paul, W.J.: Computer architecture: complexity and correctness. Springer, Heidelberg (2000)
17. Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ronchi, S. D., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 652-671. Springer, Heidelberg (1989)
18. Schewe, S., Finkbeiner, B.: Bounded synthesis. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 474-488. Springer, Heidelberg (2007)
19. Schneider, K., Logothetis, G.: Abstraction of systems with counters for symbolic model checking. In: Mutz, M., Lange, N. (eds.) Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, Braunschweig, Germany, pp. 31-40. Shaker, Aachen (1999)
20. Sohail, S., Somenzi, F.: Safety first: A two-stage algorithm for LTL games. In: FMCAD, pp. 77-84. IEEE Computer Society Press, Los Alamitos (2009)
21. Somenzi, F.: CUDD: CU decision diagram package, release 2.4.2 (2009)
22. Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM, Philadelphia (2000)