Symbolic algorithm for generation büchi automata from LTL formulas

Authors:
Irina V. Shoshmina;Alexey B. Belyaev
Affiliations:
Saint-Petersburg State Polytechnical University, Distributed Computing and Networking Department, St. Petersburg, Russia;Saint-Petersburg State Polytechnical University, Distributed Computing and Networking Department, St. Petersburg, Russia
Venue:
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Year:
2011

Citing 8
Cited 0

Alternating automata on infinite objects, determinacy and Rabin's theorem

Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Nontraditional Applications of Automata Theory

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata

FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Improved Automata Generation for Linear Temporal Logic

CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Alternating automata and the temporal logic of ordinals

Alternating automata and the temporal logic of ordinals
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual

Quantified Score

Hi-index	0.00

Visualization

Abstract

Model checking is a new techology developed to ensure the correctness of concurrent systems. In this paper we consider one of the algorithms included in this techology, an algorithm for constructing Büchi automaton from a given LTL formula. This algorithm uses an alternating automaton as an intermediate model while translating the LTL formula to a generalized Büchi automaton. We represent data structures and data manipulations with BDD to increase algorithm effectiveness. The algorithm is compared on time and resulting Büchi automaton size with well known LTL to Büchi realizations (SPIN, LTL2BA), and it shows its effectiveness for wide class of LTL formulas.