See this document in CiteSeerX!

Fair Simulation Minimization (2002)  (Make Corrections)  (9 citations)
Sankar Gurumurthy, Roderick Bloem, Fabio Somenzi



  Home/Search   Context   Related

 
View or download:
colorado.edu/personal/rbloe...fairSM.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  colorado.edu/personal/rbl...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present an algorithm for the minimization of Buchi automata based on the notion of fair simulation introduced in [6]. Unlike direct simulation, fair simulation allows flexibility in the satisfaction of the acceptance conditions, and hence leads to larger relations. However, it is not always possible to remove edges to simulated states or merge simulation-equivalent states without altering the language of the automaton. Solutions proposed in the past consisted in checking sufficient... (Update)

Cited by:   More
Automata-Theoretic Model Checking Revisited - Vardi   (Correct)
Büchi Complementation: A Forty-Year Saga - Vardi (2006)   (Correct)
Complementation Constructions for Nondeterministic Automata.. - Kupferman, Vardi (2005)   (Correct)

Active bibliography (related documents):   More   All
0.3:   A Hierarchy of Polynomial-Time Computable Simulations for Automata - Etessami (2002)   (Correct)
0.3:   Constructing Büchi Automata from Linear Temporal Logic Using.. - Fritz (2003)   (Correct)
0.3:   State Space Reductions for Alternating Büchi Automata.. - Fritz, Wilke (2002)   (Correct)

Similar documents based on text:   More   All
0.6:   A Comparative Study of Symbolic Algorithms for the.. - Ravi, Bloem, Somenzi   (Correct)
0.5:   Efficient Decision Procedures for Model Checking of Linear .. - Bloem, Ravi, Somenzi (1999)   (Correct)
0.5:   Divide and Compose: SCC Refinement for Language Emptiness - Roderick   (Correct)

Related documents from co-citation:   More   All
6:   Fast LTL to Buchi automata translation (context) - Gastin, Oddoux - 2001
5:   Simple on-the-fly automatic verification of linear temporal logic - Gerth, Peled et al. - 1995
5:   Reasoning about infinite computations - Vardi, Wolper - 1994

BibTeX entry:   (Update)

Sankar Gurumurthy, Roderick Bloem, and Fabio Somenzi. Fair simulation minimization. CAV 2002, to appear. http://citeseer.ist.psu.edu/gurumurthy02fair.html   More

@misc{ gurumurthy02fair,
  author = "S. Gurumurthy and R. Bloem and F. Somenzi",
  title = "Fair simulation minimization",
  text = "Sankar Gurumurthy, Roderick Bloem, and Fabio Somenzi. Fair simulation minimization.
    CAV 2002, to appear.",
  year = "2002",
  url = "citeseer.ist.psu.edu/gurumurthy02fair.html" }
Citations (may not include all citations):
1933   Communication and Concurrency (context) - Milner - 1989
267   Computer-Aided Verification of Coordinating Processes (context) - Kurshan - 1994
230   Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
100   mu-calculus and determinacy (context) - Emerson, Jutla - 1991
78   the synthesis of strategies in infinite games - Thomas - 1995
71   Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
37   Checking for language inclusion using simulation relations - Dill, Hu et al. - 1991
27   Fair simulation - Henzinger, Kupferman et al. - 1997
24   Efficient Buchi automata from LTL formulae (context) - Somenzi, Bloem - 2000
21   Optimizing Buchi automata - Etessami, Holzmann
17   Efficient decision procedures for model checking of linear t.. - Bloem, Ravi et al. - 1999
10   Small progress measures for solving parity games - Jurdzinski - 2000
7   and state space reduction for Buchi automata (context) - Etessami, Wilke et al. - 2001



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://vlsi.colorado.edu/personal/rbloem/index.html):
Efficient Büchi Automata from LTL Formulae - Somenzi, Bloem (2000)   (Correct)
Search Techniques and Automata for Symbolic Model Checking - Bloem (2001)   (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