Synthesis for multi-weighted games with branching-time winning conditions
From MaRDI portal
(Redirected from Publication:5100749)
Recommendations
Cites work
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 1759436 (Why is no real title available?)
- scientific article; zbMATH DE number 1759605 (Why is no real title available?)
- scientific article; zbMATH DE number 1444727 (Why is no real title available?)
- Alternation-free weighted mu-calculus: decidability and completeness
- Average-energy games
- Better Quality in Synthesis through Quantitative Objectives
- Efficient timed model checking for discrete-time systems
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Fixed-dimensional energy games are in pseudo-polynomial time
- Formally reasoning about quality
- Generalized mean-payoff and energy games
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Model checking and synthesis for branching multi-weighted logics
- Simple linear-time algorithms for minimal fixed points
- Succinct representations of graphs
- Synthesizing robust systems
- Temporal specifications with accumulative values
This page was built for publication: Synthesis for multi-weighted games with branching-time winning conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100749)