Vardi, M. Y.: An automata-theoretic approach to linear time temporal logic. In Logics for Concurrency - Structure vs. Automata, Lecture Notes in Computer Science 1043, Springer-Verlag (1996) 238-266 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000) (1 citation) (Correct)
....the emptiness problem for Buchi automata can be solved in time linear in the size of the automaton. Thus we arrive at: Theorem 2.3. 2 (Vardi, Wolper [147] The satisfiability problem for LTL is It has been shown that the problem is in fact PSPACE complete [127] In more recent developments, Vardi [145] shows that the satisfiability problem can also be solved by means of alternating automata. This class of automata is an extension, not only allowing existential quantification (as nondeterministic automata) but also universal quantification and combinations of both. A run of an alternating ....
Vardi, M. Y.: An automata-theoretic approach to linear time temporal logic. In Moller, F., Birtwistle, G. (Eds.): Logics for Concurrency --- Structure vs. Automata, Lecture Notes in Computer Science 1043,
Temporal Logic Extended by Universal Quantifiers - Maidl (Correct)
.... ers only within state predicates such that 8x 1 : 8xn 0 , Lemma 1 provides an easy way to prove that satis ability and validity of LTL det,8 are decidable: For an LTL det,8 , the decision algorithms for linear temporal logic are applied to 0 , i.e.a recognizing automaton [VW86] is constructed, where universal quanti cation over x 1 ; xn has to be applied to all states of the automaton. Theorem 1 Satis ability and validity are decidable for LTL det,8 if the language in which state predicates are expressed (which has to allow quanti ers) is decidable. ....
....pre xed by the universal quanti ers of the original formula . Model checking of linear time logic is done by constructing an automaton that recognizes models of the negation of the temporal formula, and by checking whether the product of this automaton with the model of the program is nonempty [VW86] Here it suces to to apply quanti cation to the state predicates that label the nodes of the automaton. Parameterized systems Parameterized systems are another form of programs with in nite state space. A parameterized program is a family of programs, for every natural number n, the family ....
Vardi, M. Y. and Wolper, P. An automata-theoretic approach to linear time temporal logic. In: Proc. 1st Symposium on Logic in Computer Science. Cambridge, 1986, pp. 322-331. 5
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000) (1 citation) (Correct)
....automata can be solved in time linear in the size of the automaton. Thus we arrive at: Theorem 2.3.2 (Vardi, Wolper [147] The satisfiability problem for LTL is decidable in exponential time. It has been shown that the problem is in fact PSPACE complete [127] In more recent developments, Vardi [145] shows that the satisfiability problem can also be solved by means of alternating automata. This class of automata is an extension, not only allowing existential quantification (as nondeterministic automata) but also universal quantification and combinations of both. A run of an alternating ....
Vardi, M. Y.: An automata-theoretic approach to linear time temporal logic. In Moller, F., Birtwistle, G. (Eds.): Logics for Concurrency --- Structure vs. Automata, Lecture Notes in Computer Science 1043, Springer-Verlag (1996) 238--266
Flatness is not a Weakness - Comon, Cortier (2000) (12 citations) (Correct)
....one can compute multiplication; from one loop to two nested loops we move from decidable to undecidable theories. More interestingly, flatness appears naturally in PLTL itself: following the automata approach, the models of a PLTL formula are recognized by a weak alternating automaton (see e.g. [19]) Weakness means that there is an ordering on the states such that any state occurring in the image of q by the transition function is smaller (or equal to) q. Hence weak is a synonym of flat in the context of alternating automata, though the Buchi automaton accepting the same language as a ....
M. Vardi. An automata-theoretic approach to linear time temporal logic. In Logic for concurrency: structure versus automata, volume 1043 of Lecture Notes in Computer Science. Springer Verlag, 1996.
Distributed Versions of Linear Time Temporal Logic: A.. - Thiagarajan, Henriksen (1998) (6 citations) (Correct)
No context found.
Vardi, M. Y.: An automata-theoretic approach to linear time temporal logic. In Logics for Concurrency - Structure vs. Automata, Lecture Notes in Computer Science 1043, Springer-Verlag (1996) 238-266
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