GR(1)*: GR(1) specifications extended with existential guarantees

DOI10.1007/s00165-021-00535-6OpenAlexW3175353243MaRDI QIDQ1982646

Gal Amram, Or Pistiner, Shahar Maoz

Publication date: 14 September 2021

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-021-00535-6

zbMATH Keywords

synthesisreactive systemsexistential guaranteesGR(1)

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items

Performance heuristics for GR(1) synthesis and related algorithms

Uses Software

• CUDD
• Rex
• TuLiP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis of Reactive(1) designs
• CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
• Using abduction and induction for operational requirements elaboration
• An improved algorithm for the evaluation of fixpoint expressions
• Quantitative assume guarantee synthesis
• Performance heuristics for GR(1) synthesis and related algorithms
• Bridging the gap between fair simulation and trace inclusion
• A lattice-theoretical fixpoint theorem and its applications
• SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS
• Qex: Symbolic SQL Query Explorer
• Interpolation-Based GR(1) Assumptions Refinement
• Cooperative Reactive Synthesis
• Graph-Based Algorithms for Boolean Function Manipulation
• “Sometimes” and “not never” revisited
• Church's Problem Revisited
• Revisiting Synthesis of GR(1) Specifications
• Diagnostic Information for Realizability
• Tools and Algorithms for the Construction and Analysis of Systems
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: GR(1)*: GR(1) specifications extended with existential guarantees