Name
Abstract | ||
|---|---|---|
Quantitative extensions of temporal logics have recently attracted significant attention. In this work, we study frequency LTL (fLTL), an extension of LTL which allows to speak about frequencies of events along an execution. Such an extension is particularly useful for probabilistic systems that often cannot fulfil strict qualitative guarantees on the behaviour. It has been recently shown that controller synthesis for Markov decision processes and fLTL is decidable when all the bounds on frequencies are 1. As a step towards a complete quantitative solution, we show that the problem is decidable for the fragment fLTL$setminus$GU, where U does not occur in the scope of G (but still F can). Our solution is based on a novel translation of such quantitative formulae into equivalent deterministic automata. |
Year | Venue | Field |
|---|---|---|
2015 | arXiv: Logic in Computer Science | Discrete mathematics,Control theory,Automaton,Algorithm,Markov decision process,Decidability,Probabilistic logic,Mathematics |
DocType | Volume | Citations |
Journal | abs/1509.04116 | 0 |
PageRank | References | Authors |
0.34 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vojtech Forejt | 1 | 302 | 14.69 |
| Jan Krčál | 2 | 79 | 7.45 |
| Jan Kretínský | 3 | 159 | 16.02 |