A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Bchi automata with applications to temporal logic. Theoretical Computer Science, 49(23):217237, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Complexity of Temporal Logic Model Checking - Schnoebelen (2002) (2 citations) (Correct)
....exists many proposals for logics that extend LTL (sometimes greatly) without being essentially more di cult for model checking. Four well known examples are CTL # (seen in Section 3.1. 3) LTL extended with (essentially) Bchi automata [Wol83] LTL with existential quanti cation over propositions [SVW87] and LTL Past that we consider in Section 5 below. # 4.1 Fragments of LTL 4.1.1 Restricted set of modalities Some fragments of LTL are obtained by restricting the allowed modalities. e.g. L(U) is LTL where U is the only allowed modality (X is not allowed but F is since it can be expressed ....
A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Bchi automata with applications to temporal logic. Theoretical Computer Science, 49(23):217237, 1987.
A Dynamic Perspective on an Agent's Mental States and.. - Jonker, Treur (2002) (1 citation) (Correct)
....is trust monotony: the better the experiences with something or someone, the higher the trust . This type of relative property can be expressed in our language, whereas in standard forms of temporal logic different alternative histories cannot be compared; for example, in LTL or Quantified LTL [19] no quantification over traces is possible. For the temporal trace language TTL a software environment has been developed including an editor to specify dynamic properties and a (model) checker to check given traces against dynamic properties specified in TTL. As the current paper focuses on ....
Sistla A.P. , M.Y. Vardi, and P. Wolper, The complementation Problem for Bchi Automata with Applications to Temporal Logic, Theoretical Computer Science, vol. 49, 1987, pp. 217-237.
Temporal Logic with Forgettable Past - Laroussinie, Markey, Schnoebelen (2002) (5 citations) (Correct)
.... for LTL Past and mu calculus Past in [17, 24, 12, 13] these logics have PSPACE complete verification problems) N can be encoded in richer formalisms, e.g. QPLTL (PLTL with arbitrary quantification over propositional variables) but QPLTL and QLTL have non elementary verification problems [22]. Chop is another modality where part of the computation can be forgotten: here too verification becomes non elementary [10, 20] Plan of the paper. We provide the necessary definitions in 2, study succinctness issues in 3, and provide automata theoretic decision procedures for NLTL in 4. Model ....
A. P. Sistla, M. Vardi, and P. Wolper. The complementation problem for Bchi automata with applications to temporal logic. Theoretical Computer Science, 49(2--3):217-- 237, 1987.
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