loading
From Dynamic Condition Response Structures to Büchi Automata
2010 Edition, August 1, 2010 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Recently we have presented distributed dynamic condition response structures (DCR structures) as a declarative process model conservatively generalizing labelled event structures to allow for finite specifications of repeated, possibly infinite...

Nested emptiness search for generalized Buchi automata
2004 Edition, January 1, 2004 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

We generalize the classic explicit state emptiness checking algorithm for Buchi word automata (the "nested depth-first search") into Buchi automata with multiple acceptance conditions. Bypassing an explicit acceptance condition reduction improves the algorithm's...

Direct translation of LTL formulas to Büchi automata
2012 Edition, August 1, 2012 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

The translation from LTL formulas to Büchi automata plays a key role in explicit model checking. Most algorithms for obtaining Büchi automata from LTL formulas involve intermediate forms, and perform simplifications on the intermediate or the final...

Minimal Büchi Automata for Certain Classes of LTL Formulas
2009 Edition, June 1, 2009 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

In this paper we calculate the minimal number of states of Buchi automata which encode some classes of linear temporal logic (LTL) formulas that are frequently used in model checking. Our results may be used for verification of the quality of algorithms which automatically translate...

Emptiness Check of Powerset Buchi Automata using Inclusion Tests
2007 Edition, July 1, 2007 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

We introduce two emptiness checks for buchi automata whose states represent sets that may include each other. The first is equivalent to a traditional emptiness check but uses inclusion tests to direct the on-the-fly construction of the automaton. The second is...

A Better Translation from LTL to Transition-based Generalized Büchi Automata
Volume PP - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Translating Linear Temporal Logic (LTL) formulas into Büchi automata is one of the most important aspects of LTL model checking. Certain successful algorithms, such as LTL2BA and SPOT, first translate an LTL formula into a Transition-based Generalized Büchi Automaton (TGBA) and...

Querying Linked Data and Büchi Automata
2014 Edition, November 1, 2014 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Linked Data is a field with ongoing development showing not only practical applications but also elegant theoretical results. Parts of these works concern the query process of Linked Data using SPARQL. Our work examines the querying of such data sources which are characterized by eventual...

Efficient translation of LTL to Büchi automata
2009 Edition, Volume 14, February 1, 2009 - Tsinghua University Press Ltd.

The construction of Bΰehl automata from linear temporal logic is a significant step in model checking. This paper presents a depth-first construction algorithm to obtain simple Bϋehl automata from linear-time temporal logic which significantly reduces the sizes of...

Control of Discrete Event Systems Modeled with Deterministic Buchi Automata
1992 Edition, June 1, 1992 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Ramadge and Wonham have established a control theory of DES modeled by state machines. Previous work by Ramadge extended the concept of controllable languages to infinite languages and presented conditions for the existence of a supervisor for systems modeled by Buchi automata....

Test Reactive Systems with Buchi Automata: Acceptance Condition Coverage Criteria and Performance Evaluation
2015 Edition, August 1, 2015 - IEEE - Institute of Electrical and Electronics Engineers, Inc.

Buchi automata have been used to specify and reason linear temporal requirements of reactive systems. A reactive system interacts with its environment constantly, and its executions may be modeled as infinite words. A key question in testing a reactive system is how to...

Advertisement