Acacia+
From MaRDI portal
Software:37002
swMATH25260MaRDI QIDQ37002FDOQ37002
Author name not available (Why is that?)
Cited In (15)
- Title not available (Why is that?)
- 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}\)
- Title not available (Why is that?)
- Semantic labelling and learning for parity game solving in LTL synthesis
- Linear temporal logic -- from infinite to finite horizon
- Safraless LTL synthesis considering maximal realizability
- Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time
- Encodings of bounded synthesis
- Efficient trace encodings of bounded synthesis for asynchronous distributed systems
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
- Symbolic model checking in non-Boolean domains
This page was built for software: Acacia+
