Exploring Finite-Word Automata for Reactive Synthesis

Simple item page
dc.contributor.advisorVardi, Moshe Y.en_US
dc.creatorMartinelli Tabajara, Lucasen_US
dc.date.accessioned2021-08-16T19:53:16Zen_US
dc.date.available2021-08-16T19:53:16Zen_US
dc.date.created2021-08en_US
dc.date.issued2021-08-13en_US
dc.date.submittedAugust 2021en_US
dc.date.updated2021-08-16T19:53:16Zen_US
dc.description.abstractFormal verification can provide confidence in the correctness of a system by checking that its implementation satisfies a formal specification of its desired behavior. Yet, a system might have to be implemented and reimplemented many times before passing verification. Program synthesis, on the other hand, presents an alternative workflow where the implementation is directly and algorithmically generated from the formal specification. One widely-studied example is reactive synthesis, which aims to synthesize a reactive system from a specification in some form of temporal logic. So far, reactive synthesis has largely resisted practical implementation, not only because of the problem's 2EXPTIME worst-case complexity, but also because algorithms often rely on manipulation of automata over infinite words, for which there are no known efficient algorithms. The goal of this thesis is to take steps towards bringing reactive synthesis to the realm of practical application by exploring the potential of synthesis algorithms using automata over finite words. Not only are finite-word automata sufficient for many use cases of reactive synthesis - for example in robotics, where systems are built to perform finite tasks - but they support algorithms that are far more efficient and amenable to implementation in practice than automata over infinite words. The work presented in this thesis demonstrates how specialized synthesis algorithms making use of automata over finite words perform significantly better in practice than general algorithms based on infinite-word automata, despite having the same theoretical complexity. It also explores how to improve the construction of such automata in a way that benefits synthesis algorithms. Finally, it shows how the algorithmic simplicity of finite-word automata allows the implementation for the first time of useful extensions of reactive synthesis that in the past have been limited purely to the realm of theory, such as synthesis under partial observability, allowing us to identify significant differences between the theoretical analysis and practical performance of the algorithms.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationMartinelli Tabajara, Lucas. "Exploring Finite-Word Automata for Reactive Synthesis." (2021) Diss., Rice University. <a href="https://hdl.handle.net/1911/111221">https://hdl.handle.net/1911/111221</a>.en_US
dc.identifier.urihttps://hdl.handle.net/1911/111221en_US
dc.language.isoengen_US
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.en_US
dc.subjectFormal methodsen_US
dc.subjectReactive synthesisen_US
dc.subjectFinite automataen_US
dc.titleExploring Finite-Word Automata for Reactive Synthesisen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelDoctoralen_US
thesis.degree.nameDoctor of Philosophyen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
MARTINELLITABAJARA-DOCUMENT-2021.pdf
Size:
1.64 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.85 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.62 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Theses and Dissertations