On solving temporal logic queries

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

Volumn 2422, Issue , 2002, Pages 163-177

  Hornus, Samuel ^a,b   Schnoebelen, Philippe ^a  

^a CNRS   (France)

^b INRIA RHÔNE ALPES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

MINIMAL SOLUTIONS; POLYNOMIAL-TIME; TEMPORAL FORMULAE; TEMPORAL MODELING; TEMPORAL QUERIES;

MODEL CHECKING;

EID: 84944033359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45719-4_12     Document Type: Conference Paper

References (13)

1. B. Bérard, M. Bidoit, A. Finkel, F. Laroussinie, A. Petit, L. Petrucci, and Ph. Schnoebelen. Systems and Software Verification. Model-Checking Techniques and Tools. Springer, 2001.
2. [BG01] G. Bruns and P. Godefroid. Temporal logic query checking (extended abstract). In Proc. 16th IEEE Symp. Logic in Computer Science (LICS'2001), Boston, MA, USA, June 2001, pages, 409-417. IEEE Comp. Soc. Press, 2001.
3. [Bry92] R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
4. [CGP99] E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
5. [Cha00] W. Chan. Temporal-logic queries. In Proc. 12th Int. Conf. Computer Aided Verification (CAV'2000), Chicago, IL, USA, July 2000, volume 1855 of Lecture Notes in Computer Science, pages, 450-463. Springer, 2000.
6. [CS92] R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. In Proc. 3rd Int. Workshop Computer Aided Verification (CAV'91), Aalborg, Denmark, July 1991, v olume 575 of Lecture Notes in Computer Science, pages, 48-58. Springer, 1992.
7. [Eme90] E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 16, pages, 995-1072. Elsevier Science, 1990.
8. [KG96] O. Kupferman and O. Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4):523-539, 1996.
9. [LMS02] F. Laroussinie, N. Markey, and Ph. Schnoebelen. On model checking durational Kripke structures (extended abstract). In Proc. 5th Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS'2002), Grenoble, France, Apr. 2002, volume 2303 of Lecture Notes in Computer Science, pages, 264-279. Springer, 2002.
10. [LST00] F. Laroussinie, Ph. Schnoebelen, and M. Turuani. On the expressivity and complexity of quantitative branching-time temporal logics. In Proc. 4th Latin American Symposium on Theoretical Informatics (LATIN'2000), Punta del Este, Uruguay, Apr. 2000, volume 1776 of Lecture Notes in Computer Science, pages, 437-446. Springer, 2000.
11. [Pap94] C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
12. [PBD+02] A. C. Patthak, I. Bhattacharya, A. Dasgupta, P. Dasgupta, and P. P. Chakrabarti. Quantified Computation Tree Logic. Information Processing Letters, 82(3):123-129, 2002.
13. [Pnu77] A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. Foundations of Computer Science (FOCS'77), Providence, RI, USA, Oct.-Nov. 1977, pages, 46-57, 1977.