The Complexity of LTL Rational Synthesis

Orna Kupferman; Noam Shenwald

doi:10.1007/978-3-030-99524-9_2

The Complexity of LTL Rational Synthesis

Orna Kupferman, Noam Shenwald^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

In rational synthesis, we automatically construct a reactive system that satisfies its specification in all rational environments, namely environments that have objectives and act to fulfill them. We complete the study of the complexity of LTL rational synthesis. Our contribution is threefold. First, we tighten the known upper bounds for settings that were left open in earlier work. Second, our complexity analysis is parametric, and we describe tight upper and lower bounds in each of the problem parameters: the game graph, the objectives of the system components, and the objectives of the environment components. Third, we generalize the definition of rational synthesis, combining the cooperative and non-cooperative approaches studied in earlier work, and extend our complexity analysis to the general definition.

Original language	English
Title of host publication	Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings
Editors	Dana Fisman, Grigore Rosu
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	25-45
Number of pages	21
ISBN (Print)	9783030995232
DOIs	https://doi.org/10.1007/978-3-030-99524-9_2
State	Published - 2022
Event	28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022 held as part of 25th European Joint Conferences on Theory and Practice of Software, ETAPS 2022 - Munich, Germany Duration: 2 Apr 2022 → 7 Apr 2022

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	13243 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022 held as part of 25th European Joint Conferences on Theory and Practice of Software, ETAPS 2022
Country/Territory	Germany
City	Munich
Period	2/04/22 → 7/04/22

Bibliographical note

Publisher Copyright:
© 2022, The Author(s).

Access to Document

10.1007/978-3-030-99524-9_2

Cite this

Kupferman, O., & Shenwald, N. (2022). The Complexity of LTL Rational Synthesis. In D. Fisman, & G. Rosu (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings (pp. 25-45). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13243 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-99524-9_2

Kupferman, Orna ; Shenwald, Noam. / The Complexity of LTL Rational Synthesis. Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings. editor / Dana Fisman ; Grigore Rosu. Springer Science and Business Media Deutschland GmbH, 2022. pp. 25-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{98c13e0b3db141f29d693fcaecf2f5f1,

title = "The Complexity of LTL Rational Synthesis",

abstract = "In rational synthesis, we automatically construct a reactive system that satisfies its specification in all rational environments, namely environments that have objectives and act to fulfill them. We complete the study of the complexity of LTL rational synthesis. Our contribution is threefold. First, we tighten the known upper bounds for settings that were left open in earlier work. Second, our complexity analysis is parametric, and we describe tight upper and lower bounds in each of the problem parameters: the game graph, the objectives of the system components, and the objectives of the environment components. Third, we generalize the definition of rational synthesis, combining the cooperative and non-cooperative approaches studied in earlier work, and extend our complexity analysis to the general definition.",

author = "Orna Kupferman and Noam Shenwald",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s).; 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022 held as part of 25th European Joint Conferences on Theory and Practice of Software, ETAPS 2022 ; Conference date: 02-04-2022 Through 07-04-2022",

year = "2022",

doi = "10.1007/978-3-030-99524-9_2",

language = "אנגלית",

isbn = "9783030995232",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "25--45",

editor = "Dana Fisman and Grigore Rosu",

booktitle = "Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings",

address = "גרמניה",

}

Kupferman, O & Shenwald, N 2022, The Complexity of LTL Rational Synthesis. in D Fisman & G Rosu (eds), Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13243 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 25-45, 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022 held as part of 25th European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, 2/04/22. https://doi.org/10.1007/978-3-030-99524-9_2

The Complexity of LTL Rational Synthesis. / Kupferman, Orna; Shenwald, Noam.
Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings. ed. / Dana Fisman; Grigore Rosu. Springer Science and Business Media Deutschland GmbH, 2022. p. 25-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13243 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The Complexity of LTL Rational Synthesis

AU - Kupferman, Orna

AU - Shenwald, Noam

PY - 2022

Y1 - 2022

N2 - In rational synthesis, we automatically construct a reactive system that satisfies its specification in all rational environments, namely environments that have objectives and act to fulfill them. We complete the study of the complexity of LTL rational synthesis. Our contribution is threefold. First, we tighten the known upper bounds for settings that were left open in earlier work. Second, our complexity analysis is parametric, and we describe tight upper and lower bounds in each of the problem parameters: the game graph, the objectives of the system components, and the objectives of the environment components. Third, we generalize the definition of rational synthesis, combining the cooperative and non-cooperative approaches studied in earlier work, and extend our complexity analysis to the general definition.

AB - In rational synthesis, we automatically construct a reactive system that satisfies its specification in all rational environments, namely environments that have objectives and act to fulfill them. We complete the study of the complexity of LTL rational synthesis. Our contribution is threefold. First, we tighten the known upper bounds for settings that were left open in earlier work. Second, our complexity analysis is parametric, and we describe tight upper and lower bounds in each of the problem parameters: the game graph, the objectives of the system components, and the objectives of the environment components. Third, we generalize the definition of rational synthesis, combining the cooperative and non-cooperative approaches studied in earlier work, and extend our complexity analysis to the general definition.

UR - http://www.scopus.com/inward/record.url?scp=85128492488&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-99524-9_2

DO - 10.1007/978-3-030-99524-9_2

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85128492488

SN - 9783030995232

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 25

EP - 45

BT - Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings

A2 - Fisman, Dana

A2 - Rosu, Grigore

PB - Springer Science and Business Media Deutschland GmbH

T2 - 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2022 held as part of 25th European Joint Conferences on Theory and Practice of Software, ETAPS 2022

Y2 - 2 April 2022 through 7 April 2022

ER -

Kupferman O, Shenwald N. The Complexity of LTL Rational Synthesis. In Fisman D, Rosu G, editors, Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings. Springer Science and Business Media Deutschland GmbH. 2022. p. 25-45. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-99524-9_2

The Complexity of LTL Rational Synthesis

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this