Pattern-Based Refinement of Assume-Guarantee Specifications in Reactive Synthesis

DOI10.1007/978-3-662-46681-0_49zbMath1420.68116OpenAlexW2395382078MaRDI QIDQ5194959

Ufuk Topcu, Salar Moarref, Rajeev Alur

Publication date: 17 September 2019

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46681-0_49

zbMATH Keywords

linear temporal logicsynthesis problemtransition ruletruth assignmentlabel transition system

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

Causality-based game solving ⋮ Compositional and symbolic synthesis of reactive controllers for multi-agent systems ⋮ Compositional synthesis of modular systems ⋮ Interpolation-Based GR(1) Assumptions Refinement ⋮ A weakness measure for GR(1) formulae ⋮ A weakness measure for GR(1) formulae ⋮ A verification-driven framework for iterative design of controllers

This page was built for publication: Pattern-Based Refinement of Assume-Guarantee Specifications in Reactive Synthesis