Temporal specifications with accumulative values

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2011, Pages 43-52

  Boker, Udi ^a,b   Chatterjee, Krishnendu ^b   Henzinger, Thomas A ^b   Kupferman, Orna ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE VALUES; AVERAGE WAITING-TIME; EXTENDED LOGIC; FLEXIBLE FRAMEWORK; FORMAL VERIFICATIONS; MODEL CHECKING PROBLEM; QUANTITATIVE OBJECTIVES; RATIONAL NUMBERS; TEMPORAL MODALITIES; TEMPORAL SPECIFICATION;

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; MODEL CHECKING; SPECIFICATIONS;

TEMPORAL LOGIC;

EID: 80052141018     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2011.33     Document Type: Conference Paper

References (33)

1. R. Alur and T. Henzinger, "A really temporal logic," Journal of the ACM, vol. 41, no. 1, pp. 181-204, 1994.
2. C. Courcoubetis, R. Alur, and D. Dill, "Model-checking for probabilistic real-time system," in Proc. of ICALP 91, ser. LNCS. Springer, 1991.
3. M. Droste, W. Kuich, and H. Vogler, "Monograph in theoretical computer science: Eatcs series," in Handbook of Weighted Automata. Springer, 2009.
4. K. Chatterjee, L. Doyen, and T. A. Henzinger, "Quantitative languages," in Proc. of CSL, ser. LNCS 5213. Springer, 2008, pp. 385-400.
5. R. Alur, A. Degorre, O. Maler, and G. Weiss, "On omega-languages defined by mean-payoff conditions," in FOSSACS, ser. LNCS, vol. 5504, 2009, pp. 333-347.
6. R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann, "Better quality in synthesis through quantitative objectives," in CAV, ser. LNCS, vol. 5643, 2009, pp. 140-156.
7. Z. Manna and A. Pnueli, "The modal logic of programs," in ICALP, ser. LNCS, vol. 71, 1979, pp. 385-409.
8. O. Kupferman and M. Vardi, "Memoryful branching-time logics," in Proc. 21st LICS, 2006, pp. 265-274.
9. L. de Alfaro, M. Faella, T. Henzinger, R. Majumdar, and M. Stoelinga, "Model checking discounted temporal properties," Theoretical Computer Science, vol. 345, no. 1, pp. 139-170, 2005. (Pubitemid 41562544)
10. M. P. Schützenberger, "On the definition of a family of automata," Information and Control, vol. 4, pp. 245-270, 1961.
11. W. Kuich and A. Salomaa, Semirings, Automata, Languages, ser. Monographs in Theoretical Computer Science. Springer, 1986, vol. 5.
12. K. Culik II and J. Karhumäki, "Finite automata computing real functions," SIAM J. Comput., vol. 23, no. 4, pp. 789-814, 1994.
13. M. Droste and D. Kuske, "Skew and infinitary formal power series," in Proc. of ICALP, ser. LNCS 2719. Springer, 2003, pp. 426-438.
14. Z. Esik and W. Kuich, "An algebraic generalization of omega-regular languages," in Proc. of MFCS, ser. LNCS 3153, 2004, pp. 648-659. (Pubitemid 39151251)
15. M. Droste and P. Gastin, "Weighted automata and weighted logics," Theoretical Computer Science, vol. 380, pp. 69-86, 2007. (Pubitemid 46754594)
16. M. Droste, W Kuich, and G. Rahonis, "Multi-valued MSO logics over words and trees," Fundamenta Informaticae, vol. 84, pp. 305-327, 2008.
17. A. Gurfinkel and M. Chechik, "Multi-valued model checking via classical model checking," in Proc. of CONCUR, ser. LNCS 2761. Springer, 2003, pp. 263-277.
18. O. Kupferman and Y. Lustig, "Lattice automata," in Proc. of VMCAI, ser. LNCS 4349. Springer, 2007, pp. 199-213. (Pubitemid 350143494)
19. M. Droste and I. Meinecke, "Describing average- and longtime-behavior by weighted MSO logics," in MFCS, 2010, pp. 537-548.
20. U. Zwick and M. Paterson, "The complexity of mean payoff games on graphs," Theoretical Computer Science, vol. 158, pp. 343-359, 1996. (Pubitemid 126411935)
21. H. Bjorklund, S. Sandberg, and S. Vorobyov, "A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games," in MFCS'04, 2004, pp. 673-685.
22. A. Chakrabarti, L. de Alfaro, T. A. Henzinger, and M. Stoelinga, "Resource interfaces," in Proc. of EMSOFT: Embedded Software, ser. LNCS 2855. Springer, 2003, pp. 117-133.
23. K. Chatterjee, L. Doyen, T. A. Henzinger, and J.-F. Raskin, "Generalized mean-payoff and energy games," in FSTTCS, ser. LIPIcs, vol. 8, 2010, pp. 505-516.
24. J. Esparza, "Decidability and complexity of Petri net problems - an introduction," in Petri Nets, ser. LNCS, vol. 1491, 1996, pp. 374-428.
25. M. Presburger, "Uber die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt," Comptes Rendus du I Congrès de Mathématiciens des Pays Slaves, pp. 92-101, 1929.
26. S. R. Kosaraju and G. F. Sullivan, "Detecting cycles in dynamic graphs in polynomial time (preliminary version)," in STOC, 1988, pp. 398-406.
27. E. A. Emerson and J. Y. Halpern, ""sometimes" and "not never" revisited: On branching versus linear time," in POPL, 1983, pp. 127-140. (Pubitemid 14477113)
28. A. Pnueli, "The temporal logic of programs," in FOCS, 1977, pp. 46-57.
29. A. P. Sistla and L. D. Zuck, "Reasoning in a restricted temporal logic," Inf. Comput., vol. 102, no. 2, pp. 167-195, 1993.
30. E. A. Emerson and E. M. Clarke, "Using branching time temporal logic to synthesize synchronization skeletons," Sci. Comput. Program., vol. 2, no. 3, pp. 241-266, 1982. (Pubitemid 14566074)
31. R. Alur and T. A. Henzinger, "Computer-aided verification: An introduction to model building and model checking for concurrent systems," Book in preparation, 1999.
32. M. Ben-Ari, A. Pnueli, and Z. Manna, "The temporal logic of branching time," Acta Inf., vol. 20, pp. 207-226, 1983.
33. M. Y Vardi and P. Wolper, "An automata-theoretic approach to automatic program verification (preliminary report)," in LICS, 1986, pp. 332-344. (Pubitemid 17563569)