Environment Assumptions for Synthesis
From MaRDI portal
Publication:3541016
DOI10.1007/978-3-540-85361-9_14zbMath1160.68437arXiv0805.4167OpenAlexW1499127572MaRDI QIDQ3541016
Barbara Jobstmann, Krishnendu Chatterjee, Thomas A. Henzinger
Publication date: 25 November 2008
Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0805.4167
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (15)
Graph Games and Reactive Synthesis ⋮ Synthesis with rational environments ⋮ Compositional Control Synthesis for Partially Observable Systems ⋮ Safraless LTL synthesis considering maximal realizability ⋮ Unnamed Item ⋮ Synthesis of Reactive(1) designs ⋮ Interpolation-Based GR(1) Assumptions Refinement ⋮ Assume-admissible synthesis ⋮ Synthesizing robust systems ⋮ On High-Quality Synthesis ⋮ The complexity of LTL rational synthesis ⋮ A weakness measure for GR(1) formulae ⋮ A weakness measure for GR(1) formulae ⋮ Iterated Boolean games ⋮ Compositional construction of most general controllers
This page was built for publication: Environment Assumptions for Synthesis
