Author:
Beyersdorff Olaf,Meier Arne,Mundhenk Martin,Schneider Thomas,Thomas Michael,Vollmer Heribert
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The model checking fingerprints of CTL operators;Acta Informatica;2018-08-01
2. Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic;International Journal of Foundations of Computer Science;2018-01
3. Parametrised Complexity of Satisfiability in Temporal Logic;ACM Transactions on Computational Logic;2017-04-13
4. A Team Based Variant of CTL;2015 22nd International Symposium on Temporal Representation and Reasoning (TIME);2015-09
5. Complexity of Model Checking for Modal Dependence Logic;SOFSEM 2012: Theory and Practice of Computer Science;2012