Complexity of weak acceptance conditions in tree automata
Information Processing Letters
Assert and negate revisited: modal semantics for UML sequence diagrams
Proceedings of the 2006 international workshop on Scenarios and state machines: models, algorithms, and tools
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
Refining the Undecidability Border of Weak Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
The transitive µ-calculus is Büchi definable
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Alternation elimination for automata over nested words
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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 | 5.23 |