Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata

Carsten Fritz

doi:10.1007/3-540-45089-0_5

ScienceGate Book Chapters

BOOK-CHAPTER

Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata

Carsten Fritz

Year: 2003 Lecture notes in computer science Pages: 35-48 Publisher: Springer Science+Business Media

DOI: 10.1007/3-540-45089-0_5

Get Full-Text PDF Get Analytical Report

Keywords:

Nondeterministic algorithm Computer science Automaton Nondeterministic finite automaton On the fly Translation (biology) Linear temporal logic Büchi automaton Algorithm Theoretical computer science Discrete mathematics Automata theory Deterministic automaton Mathematics

Metrics

Cited By

9.30

FWCI (Field Weighted Citation Impact)

Refs

0.99

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Formal Methods in Verification

Physical Sciences → Computer Science → Computational Theory and Mathematics

Logic, programming, and type systems

Physical Sciences → Computer Science → Artificial Intelligence

Natural Language Processing Techniques

Physical Sciences → Computer Science → Artificial Intelligence

Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata

Metrics

Citation History

Topics

Related Documents

Simulation relations for alternating Büchi automata

Alternating Büchi Automata

Limit-Deterministic Büchi Automata for Linear Temporal Logic

From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata

Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata