Almost linear Büchi automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057181" target="_blank" >RIV/00216224:14330/12:00057181 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1017/S0960129511000399" target="_blank" >http://dx.doi.org/10.1017/S0960129511000399</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1017/S0960129511000399" target="_blank" >10.1017/S0960129511000399</a>
Alternative languages
Result language
angličtina
Original language name
Almost linear Büchi automata
Original language description
We introduce a new fragment of Linear temporal logic (LTL) called LIO and a new class of Büchi automata (BA) called Almost linear Büchi automata (ALBA). We provide effective translations between LIO and ALBA showing that the two formalisms are expressively equivalent. As we expect applications of our results in model checking, we use two standard sources of specification formulae, namely Spec Patterns and BEEM, to study practical relevance of LIO fragment, and to compare our translation of LIO to ALBA with two standard translations of LTL to BA via alternating automata. Finally, we demonstrate that the LIO to ALBA translation can be much faster than the standard translation and the produced automata can be substantially smaller.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Mathematical Structures in Computer Science
ISSN
0960-1295
e-ISSN
—
Volume of the periodical
22
Issue of the periodical within the volume
2
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
33
Pages from-to
203-235
UT code for WoS article
000300844900004
EID of the result in the Scopus database
—