Performance heuristics for GR(1) synthesis and related algorithms
From MaRDI portal
Publication:2303873
DOI10.1007/s00236-019-00351-9zbMath1435.68195arXiv1712.01103OpenAlexW2992260124WikidataQ90444281 ScholiaQ90444281MaRDI QIDQ2303873
Jan Oliver Ringert, Shahar Maoz, Elizabeth Firman
Publication date: 6 March 2020
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.01103
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence for robotics (68T40)
Related Items (2)
GR(1)*: GR(1) specifications extended with existential guarantees ⋮ Performance heuristics for GR(1) synthesis and related algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of Reactive(1) designs
- Results on the propositional \(\mu\)-calculus
- An improved algorithm for the evaluation of fixpoint expressions
- Automata, logics, and infinite games. A guide to current research
- GR(1)*: GR(1) specifications extended with existential guarantees
- Performance heuristics for GR(1) synthesis and related algorithms
- BDD Ordering Heuristics for Classical Planning
- Interpolation-Based GR(1) Assumptions Refinement
- Graph-Based Algorithms for Boolean Function Manipulation
- Diagnostic Information for Realizability
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Performance heuristics for GR(1) synthesis and related algorithms