From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata
Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA,...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Esparza, Javier [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s) 2022 |
|---|
| Übergeordnetes Werk: |
Enthalten in: International Journal on Software Tools for Technology Transfer - Springer-Verlag, 1997, 24(2022), 4 vom: 23. Juli, Seite 635-659 |
|---|---|
| Übergeordnetes Werk: |
volume:24 ; year:2022 ; number:4 ; day:23 ; month:07 ; pages:635-659 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10009-022-00663-1 |
|---|
| Katalog-ID: |
SPR047745819 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR047745819 | ||
| 003 | DE-627 | ||
| 005 | 20230509104504.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 220803s2022 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10009-022-00663-1 |2 doi | |
| 035 | |a (DE-627)SPR047745819 | ||
| 035 | |a (SPR)s10009-022-00663-1-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Esparza, Javier |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata |
| 264 | 1 | |c 2022 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a © The Author(s) 2022 | ||
| 520 | |a Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. | ||
| 650 | 4 | |a Linear temporal logic |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Deterministic parity automata |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Synthesis |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Křetínský, Jan |4 aut | |
| 700 | 1 | |a Raskin, Jean-François |4 aut | |
| 700 | 1 | |a Sickert, Salomon |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International Journal on Software Tools for Technology Transfer |d Springer-Verlag, 1997 |g 24(2022), 4 vom: 23. Juli, Seite 635-659 |w (DE-627)SPR008001103 |7 nnns |
| 773 | 1 | 8 | |g volume:24 |g year:2022 |g number:4 |g day:23 |g month:07 |g pages:635-659 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s10009-022-00663-1 |z kostenfrei |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 951 | |a AR | ||
| 952 | |d 24 |j 2022 |e 4 |b 23 |c 07 |h 635-659 | ||
| author_variant |
j e je j k jk j f r jfr s s ss |
|---|---|
| matchkey_str |
esparzajavierketnskjanraskinjeanfranoiss:2022----:rmiereprloiadiidtriitcciuoaaoee |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1007/s10009-022-00663-1 doi (DE-627)SPR047745819 (SPR)s10009-022-00663-1-e DE-627 ger DE-627 rakwb eng Esparza, Javier verfasserin aut From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2022 Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. Linear temporal logic (dpeaa)DE-He213 Deterministic parity automata (dpeaa)DE-He213 Synthesis (dpeaa)DE-He213 Křetínský, Jan aut Raskin, Jean-François aut Sickert, Salomon aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 24(2022), 4 vom: 23. Juli, Seite 635-659 (DE-627)SPR008001103 nnns volume:24 year:2022 number:4 day:23 month:07 pages:635-659 https://dx.doi.org/10.1007/s10009-022-00663-1 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 24 2022 4 23 07 635-659 |
| spelling |
10.1007/s10009-022-00663-1 doi (DE-627)SPR047745819 (SPR)s10009-022-00663-1-e DE-627 ger DE-627 rakwb eng Esparza, Javier verfasserin aut From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2022 Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. Linear temporal logic (dpeaa)DE-He213 Deterministic parity automata (dpeaa)DE-He213 Synthesis (dpeaa)DE-He213 Křetínský, Jan aut Raskin, Jean-François aut Sickert, Salomon aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 24(2022), 4 vom: 23. Juli, Seite 635-659 (DE-627)SPR008001103 nnns volume:24 year:2022 number:4 day:23 month:07 pages:635-659 https://dx.doi.org/10.1007/s10009-022-00663-1 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 24 2022 4 23 07 635-659 |
| allfields_unstemmed |
10.1007/s10009-022-00663-1 doi (DE-627)SPR047745819 (SPR)s10009-022-00663-1-e DE-627 ger DE-627 rakwb eng Esparza, Javier verfasserin aut From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2022 Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. Linear temporal logic (dpeaa)DE-He213 Deterministic parity automata (dpeaa)DE-He213 Synthesis (dpeaa)DE-He213 Křetínský, Jan aut Raskin, Jean-François aut Sickert, Salomon aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 24(2022), 4 vom: 23. Juli, Seite 635-659 (DE-627)SPR008001103 nnns volume:24 year:2022 number:4 day:23 month:07 pages:635-659 https://dx.doi.org/10.1007/s10009-022-00663-1 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 24 2022 4 23 07 635-659 |
| allfieldsGer |
10.1007/s10009-022-00663-1 doi (DE-627)SPR047745819 (SPR)s10009-022-00663-1-e DE-627 ger DE-627 rakwb eng Esparza, Javier verfasserin aut From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2022 Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. Linear temporal logic (dpeaa)DE-He213 Deterministic parity automata (dpeaa)DE-He213 Synthesis (dpeaa)DE-He213 Křetínský, Jan aut Raskin, Jean-François aut Sickert, Salomon aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 24(2022), 4 vom: 23. Juli, Seite 635-659 (DE-627)SPR008001103 nnns volume:24 year:2022 number:4 day:23 month:07 pages:635-659 https://dx.doi.org/10.1007/s10009-022-00663-1 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 24 2022 4 23 07 635-659 |
| allfieldsSound |
10.1007/s10009-022-00663-1 doi (DE-627)SPR047745819 (SPR)s10009-022-00663-1-e DE-627 ger DE-627 rakwb eng Esparza, Javier verfasserin aut From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © The Author(s) 2022 Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. Linear temporal logic (dpeaa)DE-He213 Deterministic parity automata (dpeaa)DE-He213 Synthesis (dpeaa)DE-He213 Křetínský, Jan aut Raskin, Jean-François aut Sickert, Salomon aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 24(2022), 4 vom: 23. Juli, Seite 635-659 (DE-627)SPR008001103 nnns volume:24 year:2022 number:4 day:23 month:07 pages:635-659 https://dx.doi.org/10.1007/s10009-022-00663-1 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 24 2022 4 23 07 635-659 |
| language |
English |
| source |
Enthalten in International Journal on Software Tools for Technology Transfer 24(2022), 4 vom: 23. Juli, Seite 635-659 volume:24 year:2022 number:4 day:23 month:07 pages:635-659 |
| sourceStr |
Enthalten in International Journal on Software Tools for Technology Transfer 24(2022), 4 vom: 23. Juli, Seite 635-659 volume:24 year:2022 number:4 day:23 month:07 pages:635-659 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Linear temporal logic Deterministic parity automata Synthesis |
| isfreeaccess_bool |
true |
| container_title |
International Journal on Software Tools for Technology Transfer |
| authorswithroles_txt_mv |
Esparza, Javier @@aut@@ Křetínský, Jan @@aut@@ Raskin, Jean-François @@aut@@ Sickert, Salomon @@aut@@ |
| publishDateDaySort_date |
2022-07-23T00:00:00Z |
| hierarchy_top_id |
SPR008001103 |
| id |
SPR047745819 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR047745819</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230509104504.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">220803s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-022-00663-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR047745819</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10009-022-00663-1-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Esparza, Javier</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear temporal logic</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Deterministic parity automata</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Synthesis</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Křetínský, Jan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Raskin, Jean-François</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sickert, Salomon</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International Journal on Software Tools for Technology Transfer</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">24(2022), 4 vom: 23. Juli, Seite 635-659</subfield><subfield code="w">(DE-627)SPR008001103</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:4</subfield><subfield code="g">day:23</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:635-659</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10009-022-00663-1</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">2022</subfield><subfield code="e">4</subfield><subfield code="b">23</subfield><subfield code="c">07</subfield><subfield code="h">635-659</subfield></datafield></record></collection>
|
| author |
Esparza, Javier |
| spellingShingle |
Esparza, Javier misc Linear temporal logic misc Deterministic parity automata misc Synthesis From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata |
| authorStr |
Esparza, Javier |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR008001103 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata Linear temporal logic (dpeaa)DE-He213 Deterministic parity automata (dpeaa)DE-He213 Synthesis (dpeaa)DE-He213 |
| topic |
misc Linear temporal logic misc Deterministic parity automata misc Synthesis |
| topic_unstemmed |
misc Linear temporal logic misc Deterministic parity automata misc Synthesis |
| topic_browse |
misc Linear temporal logic misc Deterministic parity automata misc Synthesis |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
International Journal on Software Tools for Technology Transfer |
| hierarchy_parent_id |
SPR008001103 |
| hierarchy_top_title |
International Journal on Software Tools for Technology Transfer |
| isfreeaccess_txt |
true |
| familylinks_str_mv |
(DE-627)SPR008001103 |
| title |
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata |
| ctrlnum |
(DE-627)SPR047745819 (SPR)s10009-022-00663-1-e |
| title_full |
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata |
| author_sort |
Esparza, Javier |
| journal |
International Journal on Software Tools for Technology Transfer |
| journalStr |
International Journal on Software Tools for Technology Transfer |
| lang_code |
eng |
| isOA_bool |
true |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
635 |
| author_browse |
Esparza, Javier Křetínský, Jan Raskin, Jean-François Sickert, Salomon |
| container_volume |
24 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Esparza, Javier |
| doi_str_mv |
10.1007/s10009-022-00663-1 |
| title_sort |
from linear temporal logic and limit-deterministic büchi automata to deterministic parity automata |
| title_auth |
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata |
| abstract |
Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. © The Author(s) 2022 |
| abstractGer |
Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. © The Author(s) 2022 |
| abstract_unstemmed |
Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature. © The Author(s) 2022 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER |
| container_issue |
4 |
| title_short |
From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata |
| url |
https://dx.doi.org/10.1007/s10009-022-00663-1 |
| remote_bool |
true |
| author2 |
Křetínský, Jan Raskin, Jean-François Sickert, Salomon |
| author2Str |
Křetínský, Jan Raskin, Jean-François Sickert, Salomon |
| ppnlink |
SPR008001103 |
| mediatype_str_mv |
c |
| isOA_txt |
true |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10009-022-00663-1 |
| up_date |
2024-07-03T14:43:10.515Z |
| _version_ |
1803569374711250944 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR047745819</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230509104504.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">220803s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-022-00663-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR047745819</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10009-022-00663-1-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Esparza, Javier</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">From linear temporal logic and limit-deterministic Büchi automata to deterministic parity automata</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2022</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL formula. In this paper, we describe a single exponential translation from limit-deterministic Büchi automata (LDBA) to DPA and show that it can be concatenated with a recent efficient translations from LTL to LDBA to yield a double exponential, ‘Safraless’ LTL-to-DPA construction. We also report on an implementation and a comparison with other LTL-to-DPA translations on several sets of formulas from the literature.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear temporal logic</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Deterministic parity automata</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Synthesis</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Křetínský, Jan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Raskin, Jean-François</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sickert, Salomon</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International Journal on Software Tools for Technology Transfer</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">24(2022), 4 vom: 23. Juli, Seite 635-659</subfield><subfield code="w">(DE-627)SPR008001103</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:4</subfield><subfield code="g">day:23</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:635-659</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10009-022-00663-1</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">2022</subfield><subfield code="e">4</subfield><subfield code="b">23</subfield><subfield code="c">07</subfield><subfield code="h">635-659</subfield></datafield></record></collection>
|
| score |
7.4006615 |