Cited in
(36)- scientific article; zbMATH DE number 7455737 (Why is no real title available?)
- Practical synthesis of reactive systems from LTL specifications via parity games
- The complexity of counting models of linear-time temporal logic
- Looking at mean payoff through foggy windows
- Non-prenex QBF solving using abstraction
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
- scientific article; zbMATH DE number 7278100 (Why is no real title available?)
- Alpaga
- JTLV
- QUASY
- Casaal
- LTL2BA
- CirQit2
- QMiraXT
- TTM
- Synthia
- UPPAAL TIGA
- RATSY
- Semantic labelling and learning for parity game solving in LTL synthesis
- CoSyma
- Antichains
- ROCS
- Strix
- BluSTL
- Linear temporal logic -- from infinite to finite horizon
- Safraless LTL synthesis considering maximal realizability
- Encodings of bounded synthesis
- Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time
- Efficient trace encodings of bounded synthesis for asynchronous distributed systems
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- Unbeast
- Symbolic model checking in non-Boolean domains
- Owl
- DejaVu
- Leviathan
- BoSy
This page was built for software: Acacia+
