Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F23%3A00131935" target="_blank" >RIV/00216224:14330/23:00131935 - isvavai.cz</a>

Result on the web

<a href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.23" target="_blank" >https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2023.23</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.SAT.2023.23" target="_blank" >10.4230/LIPIcs.SAT.2023.23</a>

Result language

angličtina

Original language name

Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving

Original language description

This paper presents a novel application of QBF solving to automata reduction. We focus on Transition-based Emerson-Lei automata (TELA), which is a popular formalism that generalizes many traditional kinds of automata over infinite words including Büchi, co-Büchi, Rabin, Streett, and parity automata. Transitions in a TELA are labelled with acceptance marks and its accepting formula is a positive Boolean combination of atoms saying that a particular mark has to be visited infinitely or finitely often. Algorithms processing these automata are often very sensitive to the number of acceptance marks. We introduce a new technique for reducing the number of acceptance marks in TELA based on satisfiability of quantified Boolean formulas (QBF). We evaluated our reduction technique on TELA produced by state-of-the-art tools of the libraries Owl and Spot and by the tool ltl3tela. The technique reduced some acceptance marks in automata produced by all the tools. On automata with more than one acceptance mark obtained by translation of LTL formulas from literature with tools Delag and Rabinizer 4, our technique reduced 27.7% and 39.3% of acceptance marks, respectively. The reduction was even higher on automata from random formulas.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2023

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4-8, 2023, Alghero, Italy

ISBN

9783959772860

ISSN

1868-8969

e-ISSN

—

Number of pages

20

Pages from-to

1-20

Publisher name

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Place of publication

Dagstuhl, Germany

Event location

Alghero, Italy

Event date

Jan 1, 2023

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—