Büchi automaton

Known as: Buechi automata, Büchi automata, Buchi automaton

In computer science and automata theory, a Büchi automaton is a type of ω-automaton, which extends a finite automaton to infinite inputs. It accepts…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

Partial order reduction and distributed-memory processing are the two essential techniques to fight the well-known state space…

2010

We consider fragments of first-order logic and as models we allow finite and infinite words simultaneously. The only binary…

2009

Many fatal accidents of safety critical reactive systems have occurred in unexpected situations which had not been considered…

2008

Model-carrying code and security-by-contract have proposed to augment mobile code with a claim on its security behavior that…

2008

In the game theoretic approach to the synthesis of reactive systems, specifications are often given in linear time logic (LTL…

2007

Enacting tasks in a work∞ow cannot always follow a pre- deflned process model. In application domains like disaster management…

2006

SystemVerilog Assertions (SVA) is a linear temporal logic within the recently approved IEEE 1800 SystemVerilog standard. The…

2006

This paper deals with planning in the presence of constraints and preferences as proposed for the 5 th International Planning…

1999

We relate game-based model checking and model checking via 1-letter simple weak alternating Buchi automata (ISWABA) for the…

1991