From LTL to deterministic automata (A safraless compositional approach)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00088475" target="_blank" >RIV/00216224:14330/16:00088475 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10703-016-0259-2" target="_blank" >http://dx.doi.org/10.1007/s10703-016-0259-2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10703-016-0259-2" target="_blank" >10.1007/s10703-016-0259-2</a>

Result language
angličtina
Original language name
From LTL to deterministic automata (A safraless compositional approach)
Original language description
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula phi. The automaton is the product of a co-Büchi automaton for phi and an array of Rabin automata, one for each G-subformula of phi. The Rabin automaton for Gpsi is in charge of recognizing whether FGpsi holds. This information is passed to the co-Büchi automaton that decides on acceptance. As opposed to standard procedures based on Safra’s determinization, the states of all our automata have a clear logical structure, which allows for various optimizations. Experimental results show improvement in the sizes of the resulting automata compared to existing methods.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)