Deterministic Automata for the (F,G)-fragment of LTL
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057483" target="_blank" >RIV/00216224:14330/12:00057483 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-31424-7_7" target="_blank" >http://dx.doi.org/10.1007/978-3-642-31424-7_7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-31424-7_7" target="_blank" >10.1007/978-3-642-31424-7_7</a>
Alternative languages
Result language
angličtina
Original language name
Deterministic Automata for the (F,G)-fragment of LTL
Original language description
When dealing with linear temporal logic properties in the setting of e.g. games or probabilistic systems, one often needs to express them as deterministic omega-automata. In order to translate LTL to deterministic omega-automata, the traditional approachfirst translates the formula to a non-deterministic Buchi automaton. Then a determinization procedure such as of Safra is performed yielding a deterministic omega-automaton. We present a direct translation of the (F,G)-fragment of LTL into deterministicomega-automata with no determinization procedure involved. Since our approach is tailored to LTL, we often avoid the typically unnecessarily large blowup caused by general determinization algorithms. We investigate the complexity of this translation andprovide experimental results and compare them to the traditional method.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
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)<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
Article name in the collection
Computer Aided Verification - 24th International Conference
ISBN
9783642314230
ISSN
0302-9743
e-ISSN
—
Number of pages
16
Pages from-to
7-22
Publisher name
Springer
Place of publication
Heidelberg Dordrecht London New York
Event location
Berkeley, CA, USA
Event date
Jan 1, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—