“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
14th International Colloquium on Automata, languages and programming
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Monadic Second Order Logic on Tree-Like Structures
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bounded Model Construction for Monadic Second-Order Logics
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
On the Expressive Power of CTL
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
BTL2 and the expressive power of ECTL+
Information and Computation
On compositionality and its limitations
ACM Transactions on Computational Logic (TOCL)
Polynomial time fragments of XPath with variables
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Composition Theorems for Generalized Sum and Recursively Defined Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ACM Transactions on Computational Logic (TOCL)
A comparison of succinctly represented finite-state systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Walk logic as a framework for path query languages on graph databases
Proceedings of the 16th International Conference on Database Theory
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Monadic second-order logic (MSOL) provides a general framework for expressing properties of reactive systems as modelled by trees. Monadic path logic (MPL) is obtained by restricting second-order quantification to paths reflecting computation sequences. In this paper we show that the expressive power of MPL over trees coincides with the usual branching time logic CTL* embellished with a simple form of counting. As a corollary, we derive an earlier result that CTL* coincides with the bisimulation-invariant properties of MPL. In order to prove the main result, we first prove a new Composition Theorem for trees.