Exploiting structure in LTL synthesis
Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Filiot, Emmanuel [verfasserIn] Jin, Naiyong [verfasserIn] Raskin, Jean-François [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2012 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: International Journal on Software Tools for Technology Transfer - Springer-Verlag, 1997, 15(2012), 5-6 vom: 24. Jan., Seite 541-561 |
|---|---|
| Übergeordnetes Werk: |
volume:15 ; year:2012 ; number:5-6 ; day:24 ; month:01 ; pages:541-561 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10009-012-0222-5 |
|---|
| Katalog-ID: |
SPR008005591 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR008005591 | ||
| 003 | DE-627 | ||
| 005 | 20201124023050.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201005s2012 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10009-012-0222-5 |2 doi | |
| 035 | |a (DE-627)SPR008005591 | ||
| 035 | |a (SPR)s10009-012-0222-5-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Filiot, Emmanuel |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Exploiting structure in LTL synthesis |
| 264 | 1 | |c 2012 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. | ||
| 650 | 4 | |a Synthesis |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Reactive systems |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Temporal logics |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Antichain algorithms |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Jin, Naiyong |e verfasserin |4 aut | |
| 700 | 1 | |a Raskin, Jean-François |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t International Journal on Software Tools for Technology Transfer |d Springer-Verlag, 1997 |g 15(2012), 5-6 vom: 24. Jan., Seite 541-561 |w (DE-627)SPR008001103 |7 nnns |
| 773 | 1 | 8 | |g volume:15 |g year:2012 |g number:5-6 |g day:24 |g month:01 |g pages:541-561 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s10009-012-0222-5 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 951 | |a AR | ||
| 952 | |d 15 |j 2012 |e 5-6 |b 24 |c 01 |h 541-561 | ||
| author_variant |
e f ef n j nj j f r jfr |
|---|---|
| matchkey_str |
filiotemmanueljinnaiyongraskinjeanfranoi:2012----:xliigtutrill |
| hierarchy_sort_str |
2012 |
| publishDate |
2012 |
| allfields |
10.1007/s10009-012-0222-5 doi (DE-627)SPR008005591 (SPR)s10009-012-0222-5-e DE-627 ger DE-627 rakwb eng Filiot, Emmanuel verfasserin aut Exploiting structure in LTL synthesis 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. Synthesis (dpeaa)DE-He213 Reactive systems (dpeaa)DE-He213 Temporal logics (dpeaa)DE-He213 Antichain algorithms (dpeaa)DE-He213 Jin, Naiyong verfasserin aut Raskin, Jean-François verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 15(2012), 5-6 vom: 24. Jan., Seite 541-561 (DE-627)SPR008001103 nnns volume:15 year:2012 number:5-6 day:24 month:01 pages:541-561 https://dx.doi.org/10.1007/s10009-012-0222-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 15 2012 5-6 24 01 541-561 |
| spelling |
10.1007/s10009-012-0222-5 doi (DE-627)SPR008005591 (SPR)s10009-012-0222-5-e DE-627 ger DE-627 rakwb eng Filiot, Emmanuel verfasserin aut Exploiting structure in LTL synthesis 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. Synthesis (dpeaa)DE-He213 Reactive systems (dpeaa)DE-He213 Temporal logics (dpeaa)DE-He213 Antichain algorithms (dpeaa)DE-He213 Jin, Naiyong verfasserin aut Raskin, Jean-François verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 15(2012), 5-6 vom: 24. Jan., Seite 541-561 (DE-627)SPR008001103 nnns volume:15 year:2012 number:5-6 day:24 month:01 pages:541-561 https://dx.doi.org/10.1007/s10009-012-0222-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 15 2012 5-6 24 01 541-561 |
| allfields_unstemmed |
10.1007/s10009-012-0222-5 doi (DE-627)SPR008005591 (SPR)s10009-012-0222-5-e DE-627 ger DE-627 rakwb eng Filiot, Emmanuel verfasserin aut Exploiting structure in LTL synthesis 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. Synthesis (dpeaa)DE-He213 Reactive systems (dpeaa)DE-He213 Temporal logics (dpeaa)DE-He213 Antichain algorithms (dpeaa)DE-He213 Jin, Naiyong verfasserin aut Raskin, Jean-François verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 15(2012), 5-6 vom: 24. Jan., Seite 541-561 (DE-627)SPR008001103 nnns volume:15 year:2012 number:5-6 day:24 month:01 pages:541-561 https://dx.doi.org/10.1007/s10009-012-0222-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 15 2012 5-6 24 01 541-561 |
| allfieldsGer |
10.1007/s10009-012-0222-5 doi (DE-627)SPR008005591 (SPR)s10009-012-0222-5-e DE-627 ger DE-627 rakwb eng Filiot, Emmanuel verfasserin aut Exploiting structure in LTL synthesis 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. Synthesis (dpeaa)DE-He213 Reactive systems (dpeaa)DE-He213 Temporal logics (dpeaa)DE-He213 Antichain algorithms (dpeaa)DE-He213 Jin, Naiyong verfasserin aut Raskin, Jean-François verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 15(2012), 5-6 vom: 24. Jan., Seite 541-561 (DE-627)SPR008001103 nnns volume:15 year:2012 number:5-6 day:24 month:01 pages:541-561 https://dx.doi.org/10.1007/s10009-012-0222-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 15 2012 5-6 24 01 541-561 |
| allfieldsSound |
10.1007/s10009-012-0222-5 doi (DE-627)SPR008005591 (SPR)s10009-012-0222-5-e DE-627 ger DE-627 rakwb eng Filiot, Emmanuel verfasserin aut Exploiting structure in LTL synthesis 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. Synthesis (dpeaa)DE-He213 Reactive systems (dpeaa)DE-He213 Temporal logics (dpeaa)DE-He213 Antichain algorithms (dpeaa)DE-He213 Jin, Naiyong verfasserin aut Raskin, Jean-François verfasserin aut Enthalten in International Journal on Software Tools for Technology Transfer Springer-Verlag, 1997 15(2012), 5-6 vom: 24. Jan., Seite 541-561 (DE-627)SPR008001103 nnns volume:15 year:2012 number:5-6 day:24 month:01 pages:541-561 https://dx.doi.org/10.1007/s10009-012-0222-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER AR 15 2012 5-6 24 01 541-561 |
| language |
English |
| source |
Enthalten in International Journal on Software Tools for Technology Transfer 15(2012), 5-6 vom: 24. Jan., Seite 541-561 volume:15 year:2012 number:5-6 day:24 month:01 pages:541-561 |
| sourceStr |
Enthalten in International Journal on Software Tools for Technology Transfer 15(2012), 5-6 vom: 24. Jan., Seite 541-561 volume:15 year:2012 number:5-6 day:24 month:01 pages:541-561 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Synthesis Reactive systems Temporal logics Antichain algorithms |
| isfreeaccess_bool |
false |
| container_title |
International Journal on Software Tools for Technology Transfer |
| authorswithroles_txt_mv |
Filiot, Emmanuel @@aut@@ Jin, Naiyong @@aut@@ Raskin, Jean-François @@aut@@ |
| publishDateDaySort_date |
2012-01-24T00:00:00Z |
| hierarchy_top_id |
SPR008001103 |
| id |
SPR008005591 |
| 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">SPR008005591</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124023050.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2012 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-012-0222-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR008005591</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10009-012-0222-5-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">Filiot, Emmanuel</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Exploiting structure in LTL synthesis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</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="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Synthesis</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reactive systems</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Temporal logics</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Antichain algorithms</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jin, Naiyong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Raskin, Jean-François</subfield><subfield code="e">verfasserin</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">15(2012), 5-6 vom: 24. Jan., Seite 541-561</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:15</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:5-6</subfield><subfield code="g">day:24</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:541-561</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10009-012-0222-5</subfield><subfield code="z">lizenzpflichtig</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">15</subfield><subfield code="j">2012</subfield><subfield code="e">5-6</subfield><subfield code="b">24</subfield><subfield code="c">01</subfield><subfield code="h">541-561</subfield></datafield></record></collection>
|
| author |
Filiot, Emmanuel |
| spellingShingle |
Filiot, Emmanuel misc Synthesis misc Reactive systems misc Temporal logics misc Antichain algorithms Exploiting structure in LTL synthesis |
| authorStr |
Filiot, Emmanuel |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR008001103 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
Exploiting structure in LTL synthesis Synthesis (dpeaa)DE-He213 Reactive systems (dpeaa)DE-He213 Temporal logics (dpeaa)DE-He213 Antichain algorithms (dpeaa)DE-He213 |
| topic |
misc Synthesis misc Reactive systems misc Temporal logics misc Antichain algorithms |
| topic_unstemmed |
misc Synthesis misc Reactive systems misc Temporal logics misc Antichain algorithms |
| topic_browse |
misc Synthesis misc Reactive systems misc Temporal logics misc Antichain algorithms |
| 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 |
false |
| familylinks_str_mv |
(DE-627)SPR008001103 |
| title |
Exploiting structure in LTL synthesis |
| ctrlnum |
(DE-627)SPR008005591 (SPR)s10009-012-0222-5-e |
| title_full |
Exploiting structure in LTL synthesis |
| author_sort |
Filiot, Emmanuel |
| journal |
International Journal on Software Tools for Technology Transfer |
| journalStr |
International Journal on Software Tools for Technology Transfer |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2012 |
| contenttype_str_mv |
txt |
| container_start_page |
541 |
| author_browse |
Filiot, Emmanuel Jin, Naiyong Raskin, Jean-François |
| container_volume |
15 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Filiot, Emmanuel |
| doi_str_mv |
10.1007/s10009-012-0222-5 |
| author2-role |
verfasserin |
| title_sort |
exploiting structure in ltl synthesis |
| title_auth |
Exploiting structure in LTL synthesis |
| abstract |
Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. |
| abstractGer |
Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. |
| abstract_unstemmed |
Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER |
| container_issue |
5-6 |
| title_short |
Exploiting structure in LTL synthesis |
| url |
https://dx.doi.org/10.1007/s10009-012-0222-5 |
| remote_bool |
true |
| author2 |
Jin, Naiyong Raskin, Jean-François |
| author2Str |
Jin, Naiyong Raskin, Jean-François |
| ppnlink |
SPR008001103 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10009-012-0222-5 |
| up_date |
2024-07-03T16:42:59.571Z |
| _version_ |
1803576912978640896 |
| 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">SPR008005591</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124023050.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201005s2012 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10009-012-0222-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR008005591</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s10009-012-0222-5-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">Filiot, Emmanuel</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Exploiting structure in LTL synthesis</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</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="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper, we show how to exploit the structure of some automata-based construction to efficiently solve the LTL synthesis problem. We focus on a construction proposed in Schewe and Finkbeiner that reduces the synthesis problem to a safety game, which can then be solved by computing the solution of the classical fixpoint equation νX.Safe ∩ CPre(X), where CPre(X) are the controllable predecessors of X. We have shown in previous works that the sets computed during the fixpoint algorithm can be equipped with a partial order that allows one to represent them very compactly, by the antichain of their maximal elements. However the computation of CPre(X) cannot be done in polynomial time when X is represented by an antichain (unless P = NP). This motivates the use of SAT solvers to compute CPre(X). Also, we show that the CPre operator can be replaced by a weaker operator $ CPre_{crit} $ where the adversary is restricted to play a subset of critical signals. We show that the fixpoints of the two operators coincide, and so, instead of applying iteratively CPre, we can apply iteratively $ CPre_{crit} $. In practice, this leads to important improvements on previous LTL synthesis methods. The reduction to SAT problems and the weakening of the CPre operator into $ CPre_{crit} $ and their performance evaluations are new.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Synthesis</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reactive systems</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Temporal logics</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Antichain algorithms</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jin, Naiyong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Raskin, Jean-François</subfield><subfield code="e">verfasserin</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">15(2012), 5-6 vom: 24. Jan., Seite 541-561</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:15</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:5-6</subfield><subfield code="g">day:24</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:541-561</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s10009-012-0222-5</subfield><subfield code="z">lizenzpflichtig</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">15</subfield><subfield code="j">2012</subfield><subfield code="e">5-6</subfield><subfield code="b">24</subfield><subfield code="c">01</subfield><subfield code="h">541-561</subfield></datafield></record></collection>
|
| score |
7.402916 |