Synthesis of succinct systems
From MaRDI portal
Publication:2353397
DOI10.1016/j.jcss.2015.02.005zbMath1320.68078OpenAlexW2053962231MaRDI QIDQ2353397
Sven Schewe, John Fearnley, Doron A. Peled
Publication date: 13 July 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2015.02.005
Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turing machines that take advice
- Unbeast: Symbolic Bounded Synthesis
- Bounded Synthesis
- An Antichain Algorithm for LTL Realizability
- Alternation
- Synthesis of Succinct Systems
- An automata-theoretic approach to branching-time model checking
- Verification, Model Checking, and Abstract Interpretation