P. Schnoebelen, The complexity of temporal logic model checking, in: P. Balbiani, N.-Y. Suzuki, F. Wolter, M. Zakharyascev (Eds.), in: Advanced in Modal Logic, vol. 4, King's College Publications, London, 2003, pp. 393--436. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Model Checking a Path (Preliminary Report) - Markey, Schnoebelen (2003) (4 citations) Self-citation (Schnoebelen) (Correct)
.... with large state spaces , and, most importantly, how to algorithmically check that a model satis es a property These techniques rest upon a solid body of foundational knowledge regarding the expressive power of temporal logics and the computational complexity of their model checking problems [Sch03] In this paper, we consider the problem of model checking a single path. This problem appears in several situations, most notably in runtime veri cation [Dru00,Hav00,FS01] There are situations where thousands of paths are checked one by one, e.g. the Monte Carlo approach for assessing the ....
Ph. Schnoebelen. The complexity of temporal logic model checking. In Advances in Modal Logic, papers from 4th Int. Workshop on Advances in Modal Logic (AiML'2002), Sep.-Oct. 2002, Toulouse, France. World Scienti c, 2003. To appear.
Oracle Circuits for Branching-Time Model Checking - Schnoebelen (2003) (1 citation) Self-citation (Schnoebelen) (Correct)
....between high expressive power and low model checking complexity. Regarding expressive power, the principal questions have been answered and it is more or less known how the main temporal logics fare [Eme90,Rab02] Regarding computational complexity, the available knowledge is not so exhaustive [Sch03]. In particular, for several branching time temporal logics (or some of their natural fragments) the complexity of model checking is not known . Advances in this domain are welcome since it is important to understand what ideas underly optimal algorithms, and what special cases may benefit ....
....were introduced by Castro and Seara, who proved that, for all k N, P coincide with P n) where a succession of O(log ) parallel querying rounds are allowed) CS96] 2. 2 Branching time logics and NP hard path modalities We assume familiarity with temporal logic model checking [Eme90,CGP99,Sch03]. Several branching time logics combine the path quantifiers E and A with lineartime modalities whose path existence problem is in NP. Here are five examples: FCTL [EL87] or Fair CTL , allows restricting to the fair paths of a Kripke structure, where the fair paths are defined by an ....
Ph. Schnoebelen. The complexity of temporal logic model checking (invited lecture). In Advances in Modal Logic, papers from 4th Int. Workshop on Advances in Modal Logic (AiML'2002), Sep.-Oct. 2002, Toulouse, France. World Scientific, 2003. To appear. A preliminary version is available at http://www.lsv.ens-cachan.fr/Publis/.
On The Logic Of Cooperation And Propositional Control - van der Hoek, Wooldridge (2005) (1 citation) (Correct)
No context found.
P. Schnoebelen, The complexity of temporal logic model checking, in: P. Balbiani, N.-Y. Suzuki, F. Wolter, M. Zakharyascev (Eds.), in: Advanced in Modal Logic, vol. 4, King's College Publications, London, 2003, pp. 393--436.
XML Query Evaluation via CTL Model Checking - Afanasiev (2004) (Correct)
No context found.
Philippe Schnoebelen. The complexity of temporal logic model checking. In Advances in Modal Logic, volume 4, pages 437--459. King's College Publications, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC