Skip to search formSkip to main contentSkip to account menu

Generalized Büchi automaton

Known as: Generalized Buchi automaton, Labeled generalized Büchi automaton 
In automata theory, generalized Büchi automaton (GBA) is a variant of Büchi automaton. The difference with the Büchi automaton is its accepting… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Automata theoryBüchi automatonFormal verificationLinear temporal logic

Broader (1)

Model checking

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization
We present the second generation of the tool Seminator that transforms transition-based generalized Büchi automata (TGBAs) into… 
2016
2016
Conditionally Optimal Algorithms for Generalized Büchi Games
Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and… 
2015
2015
Parallel Explicit Model Checking for Generalized Büchi Automata
We present new parallel emptiness checks for LTL model checking. Unlike existing parallel emptiness checks, these are based on an… 
2013
2013
Generalized Büchi’s problem for algebraic functions and meromorphic functions
Büchi’s nth power problem asks is there a positive integer M such that any sequence $${(x_1^n,\ldots ,x_M^n)}$$ of nth powers of… 
2006
2006
Minimizing Generalized Büchi Automata
We consider the problem of minimization of generalized Buchi automata. We extend fair-simulation minimization and delayed… 
2006
2006
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
In this paper, we first introduce a new lower bound technique for the state complexity of transformations of automata. Namely we… 
Review
2005
Review
2005
On-the-Fly Emptiness Checks for Generalized Büchi Automata
Emptiness check is a key operation in the automata-theoretic approach to LTL verification. However, it is usually done on Buchi… 
Highly Cited
2004
Highly Cited
2004
SPOT: an extensible model checking library using transition-based generalized Bu/spl uml/chi automata
SPOT (SPOT produces our traces), is a C++ library offering model checking bricks that can be combined and interfaced with third… 
Highly Cited
2002
Highly Cited
2002
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
Model checking is an automated technique for checking that a system satisfies a set of required properties. With explicit-state… 
Highly Cited
2002
Highly Cited
2002
Fair Simulation Minimization
We present an algorithm for the minimization of Buchi automata based on the notion of fair simulation introduced in [6] . Unlike… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)