Moller, F., & Rabinovich, A. (1999). On the expressive power of CTL*. In Proc. of 4th Annual IEEE Symposium on Logic in Computer Science (LICS'99), pp. 360--369. IEEE Computer Science Press. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Planning Spectrum - One, Two, Three, Infinity - Pistore, Vardi (Correct)
....of planning for AE LTL goals and we prove that this problem is 2EXPTIME complete. 4.1. Tree automata and AE LTL formulas In [5] it is shown that AE LTL formulas can be expressed directly as CTL formulas. The reduction exploits the equivalence of expressive power of CTL and monadic path logic [20]. A tree can be obtained for an AE LTL formula using this reduction and Theorem 2. In this paper we describe a simpler reduction that is better suited for our algorithmic purposes. A labelled tree satisfies a formula : if a there is a suitable subset of paths of the tree that satisfy . The ....
F. Moller and A. Rabinovich. On the expressive power of CTL*. In Proc. of 4th Annual IEEE Symposium on Logic in Computer Science (LICS'99), pages 360--369. IEEE Computer Science Press, 1999.
Composition Theorem for Generalized Sum - Rabinovich (2001) (1 citation) Self-citation (Rabinovich) (Correct)
No context found.
F. Moller and A. Rabinovich. On the expressive power of CTL*. LICS 1999, 360-369.
An Infinite Hierarchy of Temporal Logics over Branching Time - Rabinovich, Maoz Self-citation (Rabinovich) (Correct)
No context found.
F. Moller and A. Rabinovich (1999). On the expressive power of CTL*. Proceedings of fourteenth IEEE Symposium on Logic in Computer Science, 360-369.
BTL2 and expressive completeness for ECTL+ - Rabinovich, Schnoebelen (2000) Self-citation (Rabinovich) (Correct)
No context found.
F. Moller and A. Rabinovich. On the expressive power of CTL . In Proc. 14th IEEE Symp. Logic in Computer Science (LICS'99), Trento, Italy, July 1999, pages 360-369. IEEE Comp. Soc. Press, 1999.
Counting on CTL*: On the Expressive Power of Monadic Path Logic - Moller, Rabinovich (2003) Self-citation (Moller Rabinovich) (Correct)
No context found.
F. Moller, A. Rabinovich, On the expressive power of CTL # , in: Proceedings of LICS'99: The fourteenth IEEE Symposium on Logic in Computer Science (1999) 360--369.
Counting on CTL*: On the Expressive Power of Monadic Path Logic - Moller, Rabinovich Self-citation (Moller Rabinovich) (Correct)
....that, if you are interested in bisimulation preserving properties, then propositional modal logic may be preferred over FOL. A related result due to Janin and Walukiewicz [18] shows that the propositional calculus coincides with the bisimulation invariant properties expressible in MSOL. Also, in [22] we show that the branching time logic CTL [3,5] coincides with the bisimulation invariant properties expressible in MPL. In this paper, we re examine this last result from a di erent perspective and consider what facility must be added to CTL to attain the expressive strength of MPL. The ....
....based on the second part of the Composition Theorem 6 (not requiring the quanti er relativisation step) handles the case where = 9X (X) with qd( n. 2 5 Related Results 5. 1 CTL versus bisimulation invariant MPL The main result in the paper complements our earlier result [22] that CTL coincides with the set of bisimulation invariant properties expressible in MPL. The proof of the earlier result follows the same compositional approach as the proof of the present result, and exploits the fact that every tree t is bisimulation equivalent to a so called wide tree t ....
F. Moller and A. Rabinovich (1999). On the expressive power of CTL . In Proceedings of LICS'99: The fourteenth IEEE Symposium on Logic in Computer Science, pp360-369.
The Planning Spectrum - One, Two, Three, Infinity - Pistore, Vardi (2005) (Correct)
No context found.
Moller, F., & Rabinovich, A. (1999). On the expressive power of CTL*. In Proc. of 4th Annual IEEE Symposium on Logic in Computer Science (LICS'99), pp. 360--369. IEEE Computer Science Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC