The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments-Reference-Cited by-同舟云学术

The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments

Published:2009-03 Issue: Volume:231 Page:277-292
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Bauland Michael,Mundhenk Martin,Schneider Thomas,Schnoor Henning,Schnoor Ilka,Vollmer Heribert

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. Generalized modal satisfiability;Bauland,2006

2. Bauland, M., M. Mundhenk, T. Schneider, H. Schnoor, I. Schnoor and H. Vollmer, The tractability of model-checking for LTL: The good, the bad, and the ugly fragments, Technical Report 07-04, Reports on Computer Science, Friedrich-Schiller-Universität Jena (2007). URL http://www.minet.uni-jena.de/Math-Net/reports/reports.html

3. The complexity of generalized satisfiability for linear temporal logic;Bauland,2007

4. Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory;Böhler;SIGACT News,2003

5. Dalmau, V., “Computational Complexity of Problems over Generalized Formulas,” Ph.D. thesis, Department de Llenguatges i Sistemes Informàtica, Universitat Politécnica de Catalunya (2000)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Leveraging Qualitative Reasoning to Learning Manipulation Tasks;Robotics;2015-07-13

2. On the applicability of Postʼs lattice;Information Processing Letters;2012-05

3. The Complexity of Reasoning for Fragments of Autoepistemic Logic;ACM Transactions on Computational Logic;2012-04

4. Model Checking CTL is Almost Always Inherently Sequential;Logical Methods in Computer Science;2011-05-17

5. The tractability of model checking for LTL;ACM Transactions on Computational Logic;2011-01