![]() ![]() Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS), 1977, 46–57. Amir Pnueli: The temporal logic of programs. ![]() Principles of Model Checking (Representation and Mind Series). ^ a b Baier, Christel Katoen, Joost-Pieter ().Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83. " "Sometimes" and "Not Never" revisited". Model checking of CTL* is PSPACE-complete and the satisfiability problem is 2EXPTIME-complete. The language of well-formed CTL* formulae is generated by the following unambiguous (with respect to bracketing) context-free grammar: ![]() This is surprising because the computational complexity of model checking in CTL* is not worse than that of LTL: they both lie in PSPACE. Both sublogics have become standards in the model checking community, while CTL* is of practical importance because it provides an expressive testbed for representing and comparing these and other logics. ĬTL and LTL were developed independently before CTL*. Emerson invented CTL and CTL model checking. LTL had been proposed for the verification of computer programs, first by Amir Pnueli in 1977. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |