Synthesis for multi-weighted games with branching-time winning conditions
DOI10.1007/978-3-030-51831-8_3zbMATH Open1503.68182OpenAlexW3037105833MaRDI QIDQ5100749FDOQ5100749
Authors: Isabella Kaufmann, Kim G. Larsen, Jiří Srba 
Publication date: 1 September 2022
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51831-8_3
Recommendations
Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Succinct representations of graphs
- Synthesizing robust systems
- Better Quality in Synthesis through Quantitative Objectives
- Title not available (Why is that?)
- Generalized mean-payoff and energy games
- Fixed-dimensional energy games are in pseudo-polynomial time
- Efficient timed model checking for discrete-time systems
- Title not available (Why is that?)
- Simple linear-time algorithms for minimal fixed points
- Temporal specifications with accumulative values
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Formally reasoning about quality
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Title not available (Why is that?)
- Average-energy games
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Alternation-free weighted mu-calculus: decidability and completeness
- Model checking and synthesis for branching multi-weighted logics
Cited In (1)
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)
