Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
On a monadic NP vs monadic co-NP
Information and Computation
Back and forth between guarded and modal logics
ACM Transactions on Computational Logic (TOCL)
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Automata logics, and infinite games
Bisimulation and language equivalence
Logic for concurrency and synchronisation
The monadic theory of finite representations of infinite words
Information Processing Letters
On characterization, definability and ω-saturated models
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Highly acyclic groups, hypergraph covers, and the guarded fragment
Journal of the ACM (JACM)
On the bisimulation invariant fragment of monadic Σ1 in the finite
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Coalgebraic correspondence theory
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We investigate properties of propositional modal logic over the classof finite structures. In particular, we show that certain knownpreservation theorems remain true over this class. We prove that aclass of finite models is defined by a first-order sentence and closedunder bisimulations if and only if it is definable by a modal formula.We also prove that a class of finite models defined by a modal formulais closed under extensions if and only if it is defined by a ♦-modal formula.