Open implication

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

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 361-372

  Greimel, Karin ^a   Bloem, Roderick ^a   Jobstmann, Barbara ^b   Vardi, Moshe ^c  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b EPFL   (Switzerland)

^c RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CASE STUDIES; LINEAR TEMPORAL LOGICS;

CHLORINE COMPOUNDS; LINGUISTICS; MODEL CHECKING; SPECIFICATION LANGUAGES; SPECIFICATIONS; TRANSLATION (LANGUAGES);

TEMPORAL LOGIC;

EID: 49049083483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_30     Document Type: Conference Paper

References (29)

1. Bloem, R., Gabow, H., Somenzi, F.: An algorithm for strongly connected component analysis in n log n symbolic steps. Formal Methods in System Design (2006)
2. Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Automatic hardware synthesis from specifications: A case study. In: DATE (2007)
3. Bloem, R., Galler, S., Jobstmann, B., Piterman, N., Pnueli, A., Weiglhofer, M.: Specify, compile, run: Hardware from PSL. In: 6th International Workshop on Compiler Optimization Meets Compiler Verification, pp. 3-16 (2007)
4. Bloem, R., Ravi, K., Somenzi, F.: Efficient decision procedures for model checking of linear time logic properties. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633. Springer, Heidelberg (1999)
5. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: International Congress on Logic, Methodology, and Philosophy of Science (1962)
6. Eisner, C., Fisman, D.: A Practical Introduction to PSL. Springer, Heidelberg (2006)
7. Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs (extended abstract). In: Proc. Foundations of Computer Science (1988)
8. Greimel, K.: Open implication. Master's thesis, Graz University of Technology (2007)
9. Harel, D., Pnueli, A.: On the development of reactive systems. In: Logics and Models of Concurrent Systems, pp. 477-498 (1985)
10. Jobstmann, B., Bloem, R.: Optimizations for LTL synthesis. In: 6th Conference on Formal Methods in Computer Aided Design (FMCAD 2006), pp. 117-124 (2006)
11. Jobstmann, B., Galler, S., Weiglhofer, M., Bloem, R.: Anzu: A tool for property synthesis. In: Computer Aided Verification, pp. 258-262 (2007)
12. King, V., Kupferman, O., Vardi, M.Y.: On the complexity of parity word automata. In: Foundations of Software Science and Computation Structures (2001)
13. Kozen, D.: Results on the propositional μ-calculus. Theoretical Computer Science 27, 333-354 (1983)
14. Kupferman, O., Piterman, N., Vardi, M.Y.: Safraless compositional synthesis. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 31-44. Springer, Heidelberg (2006)
15. Kupferman, O., Vardi, M.Y.: Relating linear and branching model checking. In: IFIP Working Conference on Programming Concepts and Methods (1998)
16. Kupferman, O., Vardi, M.Y.: Safraless decision procedures. In: Symposium on Foundations of Computer Science (FOCS 2005), pp. 531-542 (2005)
17. McIsaac, A.: Personal Communication (November 2006)
18. Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. In: Logic in Computer Science (LICS 2006), pp. 255-264 (2006)
19. Piterman, N., Pnueli, A., Sa'ar, Y.: Synthesis of reactive(1) designs. In: Proc. Verification, Model Checking and Abstract Interpretation, pp. 364-380 (2006)
20. Pnueli, A.: The temporal logic of programs. In: IEEE Symposium on Foundations of Computer Science, Providence, RI, pp. 46-57 (1977)
21. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. Symposium on Principles of Programming Languages (POPL 1989), pp. 179-190 (1989)
22. Rabin, M.O.: Automata on Infinite Objects and Church's Problem. In: Regional Conference Series in Mathematics. American Mathematical Society, Providence (1972)
23. Rosner, R.: Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science (1992)
24. Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4(2), 177-192 (1970)
25. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logic. Journal of the ACM 3, 733-749 (1985)
26. Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science (1987)
27. Vardi, M., Wolper, P.: Reasoning about infinite computations. Information and Computation 115, 1-37 (1994)
28. Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences 32(2), 182-221 (1986)
29. Yoshiura, N.: Finding the causes of unrealizability of reactive system formal specifications. In: Proc. Software Engineering and Formal Methods (SEFM 2004) (2004)