From liveness to promptness

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

Volumn 4590 LNCS, Issue , 2007, Pages 406-419

  Kupferman, Orna ^a   Piterman, Nir ^b   Vardi, Moshe Y ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b EPFL   (Switzerland)

^c RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; MODEL CHECKING; PROBLEM SOLVING;

LINEAR TEMPORAL LOGIC (LTL); PROMPT EVENTUALLY OPERATORS;

TEMPORAL LOGIC;

EID: 38149134374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73368-3_44     Document Type: Conference Paper

References (17)

1. Alur, R., Etessami, K., Torre, S.L., Peled, D.: Parametric temporal logic for model measuring. ACM ToCL 2(3), 388-107 (2001)
2. Alpern, B., Schneider, F.B.: Defining liveness. IPL 21, 181-185 (1985)
3. Biere, A., Artho, C., Schuppan, V.: Liveness checking as safety checking. In: Proc. 7th FMICS, ENTCS, vol. 66(2) (2002)
4. Beer, I., Ben-David, S., Geist, D., Gewirtzman, R., Yoeli, M.: Methodology and system for practical formal verification of reactive hardware. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 182-193. Springer, Heidelberg (1994)
5. Bloem, R., Gabow, H.N., Somenzi, F.: An algorithm for strongly connected component analysis in n log n symbolic steps. In: Johnson, S.D., Hunt, Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 37-54. Springer, Heidelberg (2000)
6. Büchi, J.R., Landweber, L.HG.: Solving sequential conditions by finite-state strategies. Trans. AMS 138, 295-311 (1969)
7. Eisner, C., Fisman, D.: A Practical Introduction to PSL. Springer, Heidelberg (2006)
8. Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional μ-calculus. In: Proc. 1st LICS, pp. 267-278 (1986)
9. Emerson, E.A., Mok, A.K., Sistla, A.P., Srinivasan, J.: Quantitative temporal reasoning. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 136-145. Springer, Heidelberg (1991)
10. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Berlin (1992)
11. Pnueli, A.: The temporal logic of programs. In: Proc. 18th FOCS, pp. 46-57 (1977)
12. Pnueli, A.: In: Transition from global to modular temporal reasoning about programs. Logics and Models of Concurrent Systems, vol. F-13 of NATO Advanced Summer Institutes, pp. 123-144 (1985)
13. Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th POPL, pp. 179-190 (1989)
14. Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM Journal of Computing 1(2), 146-160 (1972)
15. Vardi, M.Y.: Automata-theoretic model checking revisited. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 137-150. Springer, Heidelberg (2007)
16. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st LICS, pp. 332-344 (1986)
17. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. I&C 115(1), 1-37 (1994)