From LTL to unambiguous Büchi automata via disambiguation of alternating automata

DOI10.1007/S10703-021-00379-ZzbMATH Open1505.68022arXiv1907.02887OpenAlexW2953711673MaRDI QIDQ2147688FDOQ2147688

David Müller, Joachim Klein, Simon Jantsch, Christel Baier

Publication date: 20 June 2022

Published in: Formal Methods in System Design (Search for Journal in Brave)

Abstract: This paper proposes a new algorithm for the generation of unambiguous B"uchi automata (UBA) from LTL formulas. Unlike existing tableau-based LTL-to-UBA translations, our algorithm deals with very weak alternating automata (VWAA) as an intermediate representation. It relies on a new notion of unambiguity for VWAA and a disambiguation procedure for VWAA. We introduce optimizations on the VWAA level and new LTL simplifications targeted at generating small UBA. We report on an implementation of the construction in our tool duggi and discuss experimental results that compare the automata sizes and computation times of duggi with the tableau-based LTL-to-UBA translation of the SPOT tool set. Our experiments also cover the analysis of Markov chains under LTL specifications, which is an important application of UBA.

Full work available at URL: https://arxiv.org/abs/1907.02887

Recommendations

• scientific article; zbMATH DE number 1796123
• Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata
• LTL to Büchi automata translation: fast and more deterministic
• Concepts of Automata Construction from LTL
• A Unified Translation of Linear Temporal Logic to ω-Automata

zbMATH Keywords

verificationlinear temporal logicalternating automata\(\omega\)-automataunambiguous Büchi automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

• The complexity of propositional linear temporal logics
• Title not available (Why is that?)
• LTL Model Checking of Interval Markov Chains
• Automata, logics, and infinite games. A guide to current research
• Boolean functions as models for quantified Boolean formulas
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• The logic of ``initially and ``next: complete axiomatization and complexity
• Alternating automata on infinite trees
• LTL to Büchi Automata Translation: Fast and More Deterministic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Manipulating LTL Formulas Using Spot 1.0
• Title not available (Why is that?)
• Logic for programming, artificial intelligence, and reasoning. 19th international conference, LPAR-19, Stellenbosch, South Africa, December 14--19, 2013. Proceedings
• Title not available (Why is that?)
• The Complexity of Generalized Satisfiability for Linear Temporal Logic
• Title not available (Why is that?)
• Unambiguous Büchi automata.
• Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
• Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Title not available (Why is that?)
• From linear time to branching time
• Efficient minimization of deterministic weak \(\omega\)-automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Unambiguity in Automata Theory
• ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
• Markov Chains and Unambiguous Büchi Automata
• Lazy probabilistic model checking without determinisation
• Title not available (Why is that?)

Cited In (2)

• Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
• A fragment of linear temporal logic for universal very weak automata

Uses Software

• SPOT
• LTL2BA
• Delag

This page was built for publication: From LTL to unambiguous Büchi automata via disambiguation of alternating automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147688)