Efficient reactive synthesis using mode decomposition
From MaRDI portal
Publication:6605360
Cites work
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- Characterization of temporal property classes
- Compositional algorithms for LTL synthesis
- Compositionality: the significant difference. International symposium, COMPOS'97 Bad Malente, Germany, September 8--12, 1997. Revised lectures
- Deterministic generators and games for LTL fragments
- Model checking of safety properties
- More scalable LTL model checking via discovering design-space dependencies \((D^3)\)
- Owl: a library for \(\omega \)-words, automata, and LTL
- Safety, liveness and fairness in temporal logic
- Safraless Compositional Synthesis
- Synthesis of Reactive(1) designs
- Tableaux for realizability of safety specifications
- Temporal verification of reactive systems: response
- Tools and algorithms for the construction and analysis of systems. 29th international conference, TACAS 2023, held as part of the European joint conferences on theory and practice of software, ETAPS 2023, Paris, France, April 22--27, 2023. Proceedings. Pa
- Using branching time temporal logic to synthesize synchronization skeletons
This page was built for publication: Efficient reactive synthesis using mode decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605360)
