O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. of the 13th IEEE Symposium on Logic in Computer Science, pages 81 - 92, June 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
"More Deterministic" vs. "Smaller" Büchi Automata for.. - Sebastiani, Tonetta (2003) (Correct)
....bigger BA s. Notice that it is not always possible to reduce completely the presence of non deterministic decision states, as not every LTL formula j can be converted into a deterministic BA, and even deciding if it can be converted into a deterministic BA is in EXPSPACE and is PSPACE Hard [10]. In order to explore the effectiveness of the above conjecture, we thus present a new approach in which we generate from each LTL formula a Buchi automaton which is as deterministic as possible , in the sense that we try to reduce as much as we are able to the presence of non deterministic ....
.... the state corresponding to X j 1 is not in F 1 ; if so, we may loose the fairness condition F 1 if we apply (13) This fact should not be a surprise: if branching postponement were always applicable, then we could always generate a deterministic BA from a LTL formula, which is not the case [10]. Our idea is thus to apply branching postponement only to those formulae j for which we are guaranteed it does not The benefits of using semantic branching rather then syntactic branching in some automated reasoning domains are described in [8] cause incorrectness, and to apply standard ....
O. Kupferman and M.Y. Vardi. Freedom, Weakness, and Determinism: From Linear-time to Branching-time. In Proc. 13th IEEE Symposium on Logic in Computer Science, June 1998.
... Afmc - Kupferman, Vardi (Correct)
....challenges. In fact, while the construction in [KV99] for the directed case is quadratic, here we end up with quadratically many states but exponentially many transitions. Once we have a weak symmetric alternating automaton for , it is possible to generate from it an equivalent AFMC formula [KV98]. 2 Preliminaries For a set D IN of directions, a D tree is a nonempty set T D , where for every x d 2 T with x 2 D and d 2 D, we have x 2 T . The elements of T are called nodes, and the empty word is the root of T . For every x 2 T , the nodes x d, for d 2 D, are the children of ....
....free calculus. Thus, every formula in 2 2 has an equivalent formula in AFMC. For the alternation free calculus, an automata theoretic characterization in terms of symmetric alternating weak automata is well known (a similar result is proven in [AN92] for directed trees) Theorem 3. [KV98] A set T trees( can be expressed in AFMC iff T can be recognized by a symmetric weak alternating automaton. In [Kai95] Kaivola considered calculus formulas in which the 3 modality is parameterized with directions and translates 2 formulas to NBT. In order to apply Theorem 2, we should ....
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th LICS, pages 81--92, June 1998.
The Common Fragment of CTL and LTL - Maidl (2000) (4 citations) (Correct)
....properties that can be expressed simultaneously in CTL and LTL. The relationship between linear and branching time temporal logics has been studied by several researchers. Clarke and Draghicescu in [3] gave a characterization of the CTL formulas that can be expressed in LTL. Kupferman and Vardi [13] solved the opposite problem of deciding whether an LTL formula can be specified in the alternationfree calculus. This paper is concerned with the formulas that can be expressed simultaneously in LTL and CTL, where we restrict ourselves to ACTL, the fragment of CTL that uses only universal path ....
O. Kupferman and M. Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. 13th Symposium on Logic in Computer Science, 1998.
Divide and Compose: SCC Refinement for Language Emptiness - Roderick (Correct)
....of a system is contained in an SCC of a more abstract system, and because we do not have to consider all SCCs, we can often drastically limit the potential space in which a fair cycle can lie. This allows us to make very efficient use of don t care conditions. The strength of a Buchi automaton [10, 2] is an important factor in symbolic model checking. Specialized model checking algorithms for weak and especially terminal automata outperform the general language emptiness algorithm of Emerson and Lei: EFEG fair can be used for weak systems and EF fair can be used for terminal ones. For strong ....
....Q 0 0 , T T 0 , F = F 0 , and = 0 . This (rather strong) condition induces a partial order on automata, such that A A 0 implies L(A) L(A 0 ) If A A 0 , we say that A 0 is an overapproximation of A. Let C Q be an SCC of A. We define the strength of C as follows (cf. [10, 2]) C is weak if all cycles contained within it are accepting. C is terminal if it is weak, complete, and there is no edge from a node in C to any non terminal SCC. Terminality implies acceptance of all runs reaching C. C is strong if it is not weak. Note that the definition of ....
[Article contains additional citation context not shown here]
O. Kupferman and M. Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. 13th IEEE Symposium on Logic in Computer Science, June 1998.
Branching vs. Linear Time: Final Showdown - Vardi (2001) (1 citation) (Correct)
....(the universal fragment of CTL) there is Buchi automaton A: whose size is linear in j j. Furthermore, this automaton has a special structure (it is weak ) which enables the model checker to apply improved algorithms for checking the emptiness of the intersection of M with A: 10] See also [56,57] for a through analysis of the relationship between LTL and CTL model checkers. 2.3 Compositionality Model checking is known to suffer from the so called state explosion problem. In a concurrent setting, the system under consideration is typically the parallel composition of many modules. As a ....
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symp. on Logic in Computer Science, pages 81--92, June 1998.
Vacuity Detection in Temporal Model Checking - Kupferman, Vardi (1999) (12 citations) (Correct)
.... of determining whether a CTL formula has an equivalent LTL formula (a 2EXPTIME upper bound and an EXPTIME lower bound [KV98b] the complexity of determining whether an LTL formula has an equivalent alternation free calculus formula (an EXPSPACE upper bound and a PSPACE lower bound [KV98a]) and several more problems. Essentially, in all the problems above we check the equivalence between a set of trees that satisfy A , for an LTL formula , and a set of trees that is de ned directly by some branching time formalism. The best known translation of A to a tree automaton involves a ....
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symposium on Logic in Computer Science, pages 81-92, June 1998.
Automata-theoretic Decision of Timed Games - Marco Faella Salvatore (2002) (Correct)
No context found.
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. of the 13th IEEE Symposium on Logic in Computer Science, pages 81 - 92, June 1998.
Safraless Decision Procedures - Orna Kupferman Hebrew (Correct)
No context found.
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symp. on Logic in Computer Science, pages 81--92, June 1998.
Model Checking for Database Theoreticians - Moshe Vardi Rice (Correct)
No context found.
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symp. on Logic in Computer Science, pages 81--92, June 1998.
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (1 citation) (Correct)
No context found.
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proceedings of LICS'98, pages 81#92. IEEE Computer Society Press, 1998.
Generating Optimal Linear Temporal Logic Monitors by Coinduction - Sen, Rosu, Agha (2003) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From linear-time to branching-time. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'98), 1998.
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (1 citation) (Correct)
No context found.
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proceedings of LICS'98, pp. 81--92. IEEE Computer Society Press, 1998.
Generating Optimal Linear Temporal Logic Monitors by Coinduction - Sen, Rosu, Agha (2003) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From linear-time to branchingtime. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 81--92, 1998.
Generating Optimal Monitors for Extended Regular Expressions - Sen, Rosu (2003) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From linear-time to branching-time. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 81--92, 1998.
Relating Word and Tree Automata - Kupferman, Safra, Vardi (2004) (3 citations) (Correct)
No context found.
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symp. on Logic in Computer Science, pages 81-92, June 1998.
Testing Extended Regular Language Membership Incrementally.. - Rosu, Viswanathan (2003) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From linear-time to branching-time. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 81--92, 1998.
Monitoring Algorithms for Metric Temporal Logic Specifications - Thati, Rosu (2004) (1 citation) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From linear-time to branching-time. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 81--92, 1998.
Rewriting-based Techniques for Runtime Verification - Rosu, Havelund (1 citation) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. In Proc. of the IEEE Symposium on Logic in Computer Science, pages 81--92, 1998.
Generating Optimal Linear Temporal Logic Monitors by Coinduction - Sen, Rosu, Agha (2004) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From linear-time to branching-time. In Proceedings of the IEEE Symposium on Logic in Computer Science (LICS'98), 1998.
CTL+ Is Exponentially More Succinct Than CTL - Wilke (1999) (1 citation) (Correct)
No context found.
Orna Kupferman and Moshe Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In 13th Annual IEEE Symposium on Logic in Computer Science, pages 81--92, Indianaplis, Indiana, 1998.
"More Deterministic" vs. "Smaller" Büchi Automata for.. - Sebastiani, Tonetta (2003) (Correct)
No context found.
O. Kupferman and M.Y. Vardi. Freedom, Weakness, and Determinism: From Linear-time to Branching-time. In Proc. 13th IEEE Symposium on Logic in Computer Science, June 1998.
Rewriting-based Techniques for Runtime Verification - Rosu, Havelund (1 citation) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time. In Proc. of the IEEE Symposium on Logic in Computer Science, pages 81--92, 1998.
Generating Optimal Linear Temporal Logic Monitors by Coinduction - Sen, Rosu, Agha (2003) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, Weakness, and Determinism: From linear-time to branchingtime. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 81--92, 1998.
Automata-theoretic Decision of Timed Games - Faella, Torre, Murano (2002) (Correct)
No context found.
O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. of the 13th IEEE Symposium on Logic in Computer Science, pages 81 - 92, June 1998.
Search Techniques and Automata for Symbolic Model Checking - Bloem (2001) (Correct)
No context found.
O. Kupferman and M. Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. 13th IEEE Symposium on Logic in Computer Science, June 1998.
First 50 documents
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