Bounded synthesis for Streett, Rabin, and CTL^*

DOI10.1007/978-3-319-63390-9_18MaRDI QIDQ2164233zbMATH OpenOpenAlexFDO

Authors Ayrat Khalimov, Roderick Bloem

Publication date 12 August 2022

Full work available at URL https://doi.org/10.1007/978-3-319-63390-9_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• Bounded Synthesis
• Symbolic bounded synthesis
• Fast, flexible, and minimal CTL synthesis via SMT
• Encodings of bounded synthesis
• Bounded synthesis of reactive programs

Cited in

(2)

• Fast, flexible, and minimal CTL synthesis via SMT
• Encodings of bounded synthesis

This page was built for publication: Bounded synthesis for Streett, Rabin, and \(\mathrm{CTL}^*\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164233)