Synthesis for defeating adversaries with limited capabilities

dc.contributor.advisorTopcu, Ufuk
dc.contributor.committeeMemberChaudhuri, Swarat
dc.contributor.committeeMemberMcMillan, Kenneth
dc.contributor.committeeMemberDimitrova, Rayna
dc.creatorRaju, Dhananjay
dc.date.accessioned2024-01-13T20:21:29Z
dc.date.available2024-01-13T20:21:29Z
dc.date.created2023-08
dc.date.issued2023-08-17
dc.date.submittedAugust 2023
dc.date.updated2024-01-13T20:21:30Z
dc.description.abstractReactive synthesis is a potent technique enabling the automatic generation of correct-by-construction implementations of systems based on formal specifications (Bloem et al.,2018; Ehlers et al., 2015; Majumdar et al., 2019). This approach ensures that the synthesized system satisfies its specifications, regardless of the environment’s behavior, making it a more robust alternative to planning. However, reactive synthesis may fail when no system can fulfill the specification against all potential environment behaviors, such as cases where the environment prevents the system from achieving its objectives (Kress-Gazit et al., 2018). To mitigate this issue, researchers often introduce assumptions to constrain the environment’s behavior, ensuring the synthesized system operates correctly when these assumptions hold. This method, however, introduces another challenge, as the synthesized implementations might be motivated to work against the satisfaction of these assumptions (Bloemet al., 2015; Majumdar et al., 2019). An alternative viewpoint treats the interaction between the environment and the system as a strategic game, where an equilibrium between both players’ strategies is computed to guarantee that neither has an incentive to deviate. However,this approach necessitates knowledge of the environment’s objectives to facilitate strategic reasoning. In traditional reactive synthesis, environments can exhibit arbitrary behavior within their limits, with observed behavior providing no useful information. This prompts the question of whether an alternative definition for the synthesis problem could enable the formal synthesis of a correct-by-construction system in environments with unknown behaviors. Drawing inspiration from real-world adversaries, we limit the environment’s behavior. Quantifying the environment’s capabilities is crucial for solving this problem effectively, as without such constraints, the environment could act antagonistically, as in classical reactive synthesis. Concurrently, we aim to develop a controller that consistently functions correctly against the environment’s simple behaviors. In this thesis, we address the issue by restricting the environment’s behavior through limitations on a) behavioral complexity, b) observational capability, or c) the ability to modify operational space.
dc.description.departmentComputer Science
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://hdl.handle.net/2152/123415
dc.identifier.urihttps://doi.org/10.26153/tsw/50212
dc.language.isoen
dc.subjectTwo-player games
dc.subjectLimited adversaries
dc.subjectMonotonic transformation
dc.subjectSynthesis
dc.titleSynthesis for defeating adversaries with limited capabilities
dc.typeThesis
dc.type.materialtext
thesis.degree.departmentComputer Sciences
thesis.degree.disciplineComputer Science
thesis.degree.grantorThe University of Texas at Austin
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy

Access full-text files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
RAJU-DISSERTATION-2023.pdf
Size:
4.3 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
4.45 KB
Format:
Plain Text
Description:
No Thumbnail Available
Name:
LICENSE.txt
Size:
1.84 KB
Format:
Plain Text
Description: