See this document in CiteSeerX!

Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic (2005)  (Make Corrections)  
Joachim Klein, Christel Baier



  Home/Search   Context   Related

 
View or download:
web.informatik.uni...l2dstarciaa05.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  web.informatik.un...publikationen (more)
(Enter author homepages)

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

Abstract: This paper addresses the problem of generating deterministic w-auto- mata for formulas of linear temporal logic, which can be solved by applying wellknown algorithms to construct a nondeterministic Bchi automaton for the given formula on which we then apply a determinization algorithm. We study here in detail Safra's determinization algorithm, present several heuristics that attempt to decrease the size of the resulting automata and report on experimental results. (Update)

Active bibliography (related documents):   More   All
0.8:   On Translating Linear Temporal Logic into Alternating and.. - Tauriainen (2003)   (Correct)
0.6:   Testing LTL Formula Translation into Büchi Automata - Tauriainen, Heljanko (2002)   (Correct)
0.5:   Simulation Relations for Alternating Büchi Automata - Fritz, Wilke (2002)   (Correct)

Similar documents based on text:
5.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ klein-experiments,
  author = "Joachim Klein and Christel Baier",
  title = "Experiments with Deterministic ω-Automata for Formulas of Linear
    Temporal Logic",
  url = "citeseer.ist.psu.edu/klein05experiments.html" }
Citations (may not include all citations):
828   Model Checking - Clarke, Grumberg et al. - 2000
725   Temporal and modal logic (context) - Emerson - 1990
201   Three partition refinement algorithms (context) - Paige, Tarjan - 1987
142   Simple on-the-fly automatic verification of linear temporal .. - Gerth, Peled et al. - 1995
94   Model checking for a probabilistic branching time logic with.. - Baier, Kwiatkowska - 1998
85   Special issue on Formal Methods in Software Practice (context) - Holzmann - 1997
85   Patterns in property specifications for finite-state verific.. - Dwyer, Avrunin et al. - 1999
58   Model checking of safety properties - Kupferman, Vardi - 1999
30   Simulating alternating tree automata by nondeterministic aut.. (context) - Muller, Schupp - 1995
25   Deciding branching time logic (context) - Emerson, Sistla - 1984
20   Complexity of Automata on Infinite Objects - Safra - 1989
19   Formal Verification of Probabilistic Systems (context) - de Alfaro - 1997
15   Complementation is more difficult with automata on infinite .. (context) - Michel - 1988
14   Handbook of formal languages (context) - Thomas - 1997
11   Probabilistic linear-time model checking: An overview of the.. - Vardi - 1999
10   More Deterministic (context) - Sebastiani, Tonetta - 2003
7   Optimizing Bchi automata (context) - Etessami, Holzmann - 2000
6   and Infinite Games: A Guide to Current Research (context) - Grdel, Thomas et al. - 2002
5   and state space reduction for Bchi automata (context) - Etessami, Wilke et al. - 2001
5   Efficient Bchi automata from LTL formulae (context) - Somenzi, Bloem - 2000
5   and determinism: From linear-time to branching-time (context) - Kupferman, Vardi - 1998
4   Automata vis-a-vis Deterministic Buchi Automata (context) - Krishnan, Puri et al. - 1994
3   Fast LTL to Bchi automata translation (context) - Gastin, Oddoux - 2001
2   Automated testing of Bchi automata translators for linear te.. (context) - Tauriainen - 2000
1   Linear time logic and deterministic omega-automata (context) - Klein - 2005
1   Constructing Bchi automata from linear temporal logic using .. (context) - Fritz - 2003
1   Language containment of non-deterministic w- automata (context) - Tasiran, Hojati et al. - 1995
1   Optimal bounds for the transformation of omega-automata (context) - Lding - 1999
1   Efficient minimization of deterministic weak omega-automata (context) - Lding - 2001
1   Laboratory for Theoretical Computer Science (context) - Latvala, On - 2002
1   Observations on determinization of Bchi automata (context) - Althoff, Thomas et al. - 2005

Documents on the same site (http://web.informatik.uni-bonn.de/I/baier/publikationen.html):   More
Quantitative Analysis of Distributed Randomized Protocols - Baier, Ciesinski, Groesser (2005)   (Correct)
Symbolic Reasoning with Weighted and Normalized Decision.. - Ossowski, Baier (2005)   (Correct)
Synthesis of Reo Circuits for Implementation of.. - Arbab, Baier, de.. (2004)   (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