Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Co-Büchi automaton

Known as: Co-Buchi automaton 
In automata theory, a co-Büchi automaton is a variant of Büchi automaton. The only difference is the accepting condition: a Co-Büchi automaton… Expand
Wikipedia

Related topics

Related topics

4 relations
Automata theoryBüchi automatonWeak Büchi automatonΩ-automaton

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata
The paper presents a new tool ltl3tela translating LTL to deterministic or nondeterministic transition-based Emerson-Lei automata… Expand
  • table 1
  • table 2
  • table 3
  • table 4
2017
2017
Parity objectives in countable MDPs
We study countably infinite MDPs with parity objectives, and special cases with a bounded number of colors in the Mostowski… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2014
Highly Cited
2014
From LTL to Deterministic Automata: A Safraless Compositional Approach
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula i¾?. The automaton is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
2013
2013
Improved Upper and Lower Bounds for Büchi Disambiguation
We present a new ranking based construction for disambiguating non-deterministic Buchi automata and show that the state… Expand
  • figure 1
  • table 1
2010
2010
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite… Expand
  • figure 1
2010
2010
Minimisation of Deterministic Parity and Buchi Automata and Relative Minimisation of Deterministic Finite Automata
In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite… Expand
  • figure 1
2006
2006
Sequential Synthesis with Co-Büchi Specifications
Computations are developed for the synthesis of a finite state machine (FSM) embedded in a known FSM such that their combined… Expand
  • figure 1
2005
2005
Synthesizing FSMs According to Co-Büchi Properties
Computations are developed for the synthesis of an FSM embedded in a known larger system such that the overall behavior satisfies… Expand
  • figure 1
  • figure 3
  • figure 4
2002
2002
Trading Probability for Fairness
Behavioral properties of open systems can be formalized as objectives in two-player games. Turn-based games model asynchronous… Expand
Highly Cited
2001
Highly Cited
2001
Fast LTL to Büchi Automata Translation
We present an algorithm to generate Buchi automata from LTL formulae. This algorithm generates a very weak alternating co-Buchi… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE