Mathematical modal logic: a view of its evolution
Journal of Applied Logic
A unifying semantics for time and events
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
An optimizing compiler for batches of temporal logic formulas
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Combining supervisor synthesis and model checking
ACM Transactions on Embedded Computing Systems (TECS)
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
Aggregation of asymmetric distances in Computer Science
Information Sciences: an International Journal
CTL+ is complete for double exponential time
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
EXPTIME tableaux for the coalgebraic µ-calculus
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Flat coalgebraic fixed point logics
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
The modal µ-calculus caught off guard
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Comparative similarity, tree automata, and diophantine equations
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A decision procedure for CTL* based on tableaux and automata
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
The average running time of an algorithm as a midpoint between fuzzy sets
Mathematical and Computer Modelling: An International Journal
On aggregation of normed structures
Mathematical and Computer Modelling: An International Journal
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Strategy machines and their complexity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Automata-Theoretic Decision Procedures for Information Logics
Fundamenta Informaticae
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Branching-time logics with path relativisation
Journal of Computer and System Sciences
A Goal-Directed Decision Procedure for Hybrid PDL
Journal of Automated Reasoning
| Hi-index | 0.00 |
The complexity of testing nonemptiness of finite state automata on infinite trees is investigated. It is shown that for tree automata with the pairs (or complemented pairs) acceptance condition having m states and n pairs, nonemptiness can be tested in deterministic time (mn)O(n); however, it is shown that the problem is in general NP-complete (or co-NP-complete, respectively). The new nonemptiness algorithm yields exponentially improved, essentially tight upper bounds for numerous important modal logics of programs, interpreted with the usual semantics over structures generated by binary relations. For example, it follows that satisfiability for the full branching time logic CTL* can be tested in deterministic double exponential time. Another consequence is that satisfiability for propositional dynamic logic (PDL) with a repetition construct (PDL-delta) and for the propositional Mu-calculus ($L\mu$) can be tested in deterministic single exponential time.