Name
Abstract | ||
|---|---|---|
We investigate the open synthesis problem in a quantitative game theoretic setting where the system model is annotated with multiple nonnegative weights representing quantitative resources such as energy, discrete time or cost. We consider system specifications expressed in the branching time logic CTL extended with bounds on resources. As our first contribution, we show that the model checking problem for the full logic is undecidable with already three weights. By restricting the bounds to constant upper or lower-bounds on the individual weights, we demonstrate that the problem becomes decidable and that the model checking problem is PSPACE-complete. As a second contribution, we show that by imposing upper-bounds on the temporal operators and assuming that the cost converges over infinite runs, the synthesis problem is also decidable. Finally, we provide an on-the-fly algorithm for the synthesis problem on an unrestricted model for a reachability fragment of the logic and we prove EXPTIME-completeness of the synthesis problem. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jlamp.2019.02.001 | Journal of Logical and Algebraic Methods in Programming |
Keywords | Field | DocType |
Synthesis,Model checking,Quantitative,Temporal logics,Dependency graphs | Discrete mathematics,Model checking,Decidability,Reachability,Operator (computer programming),Discrete time and continuous time,CTL*,Mathematics,System model,Undecidable problem | Journal |
Volume | Issue | ISSN |
105 | 1 | 2352-2208 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lasse S. Jensen | 1 | 0 | 0.34 |
| Isabella Kaufmann | 2 | 0 | 0.34 |
| Kim Guldstrand Larsen | 3 | 4434 | 346.88 |
| Søren M. Nielsen | 4 | 0 | 0.34 |
| Jirí Srba | 5 | 252 | 28.68 |