From boolean to quantitative synthesis
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Verification of linear duration properties over continuous-time markov chains
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Specification patterns from research to industry: a case study in service-based applications
Proceedings of the 34th International Conference on Software Engineering
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The complexity of mean-payoff automaton expression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Automatic vandalism detection in wikipedia with active associative classification
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
A temporal logic with mean-payoff constraints
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Synthesis from LTL specifications with mean-payoff objectives
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Automatic generation of quality specifications
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Verification of linear duration properties over continuous-time markov chains
ACM Transactions on Computational Logic (TOCL)
From model checking to model measuring
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hyperplane separation technique for multidimensional mean-payoff games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Quantitative Monadic Second-Order Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
There is recently a significant effort to add quantitative objectives to formal verification and synthesis. We introduce and investigate the extension of temporal logics with quantitative atomic assertions, aiming for a general and flexible framework for quantitative-oriented specifications. In the heart of quantitative objectives lies the accumulation of values along a computation. It is either the accumulated summation, as with the energy objectives, or the accumulated average, as with the mean-payoff objectives. We investigate the extension of temporal logics with the {\em prefix-accumulation assertions\/} $\Sum(v) \geq c$ and $\Avg(v) \geq c$, where $v$ is a numeric variable of the system, $c$ is a constant rational number, and $\Sum(v)$ and $\Avg(v)$ denote the accumulated sum and average of the values of $v$ from the beginning of the computation up to the current point of time. We also allow the {\em path-accumulation assertions\/} $\LimInfAvg(v)\geq c$ and $\LimSupAvg(v)\geq c$, referring to the average value along an entire computation. We study the border of decidability for extensions of various temporal logics. In particular, we show that extending the fragment of CTL that has only the EX, EF, AX, and AG temporal modalities by prefix-accumulation assertions and extending LTL with path-accumulation assertions, result in temporal logics whose model-checking problem is decidable. The extended logics allow to significantly extend the currently known energy and mean-payoff objectives. Moreover, the prefix-accumulation assertions may be refined with ``controlled-accumulation'', allowing, for example, to specify constraints on the average waiting time between a request and a grant. On the negative side, we show that the fragment we point to is, in a sense, the maximal logic whose extension with prefix-accumulation assertions permits a decidable model-checking procedure. Extending a temporal logic that has the EG or EU modalities, and in particular CTL and LTL, makes the problem undecidable.