Taming large bounds in synthesis from bounded-liveness specifications
From MaRDI portal
Publication:6536131
DOI10.1007/978-3-031-30820-8_17zbMATH Open1547.6843MaRDI QIDQ6536131
Rayna Dimitrova, Philippe Heim
Publication date: 5 April 2024
Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- From liveness to promptness
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
- Practical synthesis of reactive systems from LTL specifications via parity games
- Efficient On-the-Fly Algorithms for Partially Observable Timed Games
- Parametric temporal logic for “model measuring”
- From Mtl to Deterministic Timed Automata
- Realizability of Real-Time Logics
- The benefits of relaxing punctuality
- On the synthesis of discrete controllers for timed systems
- Real-Time Synthesis is Hard!
- On Synthesizing Controllers from Bounded-Response Properties
- Controller Synthesis for MTL Specifications
- Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis
This page was built for publication: Taming large bounds in synthesis from bounded-liveness specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536131)
