Moshe Y. Vardi  Home/Search
Context
Related
| rice.edu/~vardi/papers/alc05.ps.gz From: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ot sufficient (but see erroneous claim in [16]). Due to the lack of a simple complementation construction, the user is typically required to specify the property by a deterministic Buchi automaton [13] (it is easy to complement a deterministic Buchi automaton), or to supply the automaton for the negation of the property [9]. Similarly, specification formalisms like ETL [23], which have automata within the logic, involve complementation of automata, and the difficulty of complementing Buchi... (Update)
Active bibliography (related documents): More All
1.9: Büchi Complementation Made Tighter - Friedgut, Kupferman, Vardi (2004) (Correct)
0.8: Automata-Theoretic Model Checking Revisited - Vardi (Correct)
0.6: From Complementation to Certification - Kupferman, Vardi (2004) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ vardi-bchi,
author = "Moshe Y. Vardi",
title = "Büchi Complementation: A Forty-Year Saga",
url = "citeseer.ist.psu.edu/vardi06bchi.html" }
Citations (may not include all citations):267 Computer Aided Verification of Coordinating Processes (context) - Kurshan - 1994
177 Temporal logic can be more expressive (context) - Wolper - 1983
176 a decision method in restricted second order arithmetic (context) - Buchi - 1960
139 Reasoning about infinite computations - Vardi, Wolper - 1994
96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
85 Special issue on Formal Methods in Software Practice (context) - Holzmann, checker et al. - 1997
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
39 Weak alternating automata are not that weak - Kupferman, Vardi - 2001
34 Improved automata generation for linear temporal logic - Daniele, Guinchiglia et al. - 1999
25 Fast LTL to buchi automata translation (context) - Gastin, Oddoux - 2001
25 Infinite sequences and finite machines (context) - Muller - 1963
24 Efficient Buchi automata from LTL formulae (context) - Somenzi, Bloem - 2000
15 Complementation is more difficult with automata on infinite .. (context) - Michel - 1988
9 Fair simulation minimization - Gurumurthy, Bloem et al. - 2002
4 Information and Computation (context) - Henzinger, Kupferman et al. - 2002
4 Buchi complementation made tighter (context) - Friedgut, Kupferman et al. - 2004
4 Optimal bounds for the transformation of omega-automata (context) - Loding - 1999
2 Progress measures for complementation of #-automata with app.. (context) - Klarlund - 1991
2 Non-determinism and the size of two-way automata (context) - Sakoda, Sipser - 1978
2 Bridging the gap between fair simulation and trace containme.. (context) - Kesten, Piterman et al. - 2003
2 minimal elements of regular languages (context) - Birget, on - 1993
1 Lower bounds for transformations of #-automata (context) - Yang - 2005
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (Correct)
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