Efficient Algorithms for Omega-Regular Energy Games

Amram, Gal; Maoz, Shahar; Pistiner, Or; Ringert, Jan Oliver

doi:10.1007/978-3-030-90870-6_9

Cited by 2 publications

(4 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1 lines 41-42 must be satisfied via case (2) where each w 2i = ε and each w 2i+1 visits pos1 to pos3. The trigger from lines 45-46 must be satisfied via case (3) where…”

Section: B Triggers Syntax and Semanticsmentioning

confidence: 99%

“…Hence, we redirect transitions to F 1 into q 2 0 , redirect transitions to F 2 into q 1 0 , and mark all states of A 1 as accepting. 3 Formally: Let…”

Section: B Encoding Triggersmentioning

confidence: 99%

“…We will show a few examples of triggers written by workshop participants alongside a text description of the property they intend to describe (based on the documentation written by the participants in the specification). The complete set of triggers is available as part of the supplementary material package of the paper [3], [4].…”

Section: Rq1: Usefulness Of Triggers In Expressing Propertiesmentioning

confidence: 99%

“…We further report performance results for the 30 specifications that included at least one trigger instance. Means to reproduce the experiments are available in the supplementary material package of the paper [3], [4]. For the experiments we used an AWS t3.2xlarge instance (representing an ordinary laptop with up to 3.1GHz CPU and 32GB RAM).…”

Section: Rq3: Computation Cost Of Triggersmentioning

confidence: 99%

See 3 more Smart Citations

Triggers for Reactive Synthesis Specifications

Amram

Maoz

Pistiner

et al. 2023

2023 IEEE/ACM 45th International Conference on Software Engineering (ICSE)

View full text Add to dashboard Cite

Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from its temporal logic specification. Two of the main challenges in bringing reactive synthesis to practice are its very high worst-case complexity and the difficulty of writing declarative specifications using basic LTL operators. To address the first challenge, researchers have suggested the GR(1) fragment of LTL, which has an efficient polynomial time symbolic synthesis algorithm. To address the second challenge, specification languages include higher-level constructs that aim at allowing engineers to write succinct and readable specifications. One such construct is the triggers operator, as supported, e.g., in the Property Specification Language (PSL).In this work we introduce triggers into specifications for reactive synthesis. The effectiveness of our contribution relies on a novel encoding of regular expressions using symbolic finite automata (SFA) and on a novel semantics for triggers that, in contrast to PSL triggers, admits an efficient translation into GR(1). We show that our triggers are expressive and succinct, and prove that our encoding is optimal.We have implemented our ideas on top of the Spectra language and synthesizer. We demonstrate the usefulness and effectiveness of using triggers in specifications for synthesis, as well as the challenges involved in using them, via a study of more than 300 triggers written by undergraduate students who participated in a project class on writing specifications for synthesis.To the best of our knowledge, our work is the first to introduce triggers into specifications for reactive synthesis.

show abstract

“…1 lines 41-42 must be satisfied via case (2) where each w 2i = ε and each w 2i+1 visits pos1 to pos3. The trigger from lines 45-46 must be satisfied via case (3) where…”

Section: B Triggers Syntax and Semanticsmentioning

confidence: 99%

“…Hence, we redirect transitions to F 1 into q 2 0 , redirect transitions to F 2 into q 1 0 , and mark all states of A 1 as accepting. 3 Formally: Let…”

Section: B Encoding Triggersmentioning

confidence: 99%