M. Dam. CTL and ECTL as fragments of the modal mu-calculus. TCS, 126(1):77--96, Apr. 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Model Checking Via Buchi Tableau Automata - Bhat, Cleaveland, Groce (2001) (1 citation) (Correct)
....for reducing the number of states in such automata, and [28] shows how acceptance sets for generalized Buchi automata may be reduced. Neither paper considers alternating or tree automata. The mu calculus [22] has also been proposed as an intermediate language for translation based model checking [3, 6, 16, 18]. Tool support for this translationalscheme remains problematic, however, owing in part to the complexity of the translation procedures for logics like CTL . Our performance figures also suggest that the alternation depth factor in mu calculus model checking algorithms has practical impacts: ....
M. Dam. CTL and ECTL as fragments of the modal mu-calculus. TCS, 126(1):77--96, Apr. 1994.
A New Decidability Proof for Full Branching Time Logic CPL - Shilov (Correct)
.... and the Calculus with converse [21] We would like to remark also that CTL and the propositional Calculus are closely connected not only due automata or schemata decidability technique: the propositional Calculus can encode CTL as well as some other temporal, program and polymodal logics [31]. Nevertheless, due to a non triviality of these embedding, automata based and schemata based decision procedures for CTL differs from corresponding decision procedures for the propositional Calculus. The remaining part of the paper comprises two sections. Syntax and semantics of CTL and SOPDL ....
Dam M. CTL and ECTL as fragments of the modal Mu-Calculus. Theoretical Computer Science, v.126, n.1, 1994, p.77-96.
Temporal Logics with Reference Pointers and Computation Tree Logics - Goranko (2000) (1 citation) (Correct)
....trees. Moreover, TL rp enables formalization of properties beyond the expressiveness of CTL , like talking about the past and expressing various looping and non looping conditions. Of course, CTL is known to be embeddable in another very expressive logical system, viz. Kozen s calculus (see [Dam 94] so the natural question arises about the relationship, advantages and disadvantages of the temporal logic with reference pointers proposed here as compared to the calculus. We defer that discussion to the concluding remarks. The main result in the paper is the construction of a complete ....
Dam M., CTL and ECTL as Fragments of the modal mu-calculus, Theoretical Computer Science, 126 (1994), pp77-96.
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