Temporal Specifications with Accumulative Values

@article{Boker2011TemporalSW,
  title={Temporal Specifications with Accumulative Values},
  author={Udi Boker and Krishnendu Chatterjee and Thomas A. Henzinger and Orna Kupferman},
  journal={2011 IEEE 26th Annual Symposium on Logic in Computer Science},
  year={2011},
  pages={43-52}
}
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… 
Formalizing and Reasoning about Quality
TLDR
By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, it is able to solve the above problems and show that reasoning about LTL has roughly the same complexity as reasoning about traditional LTL.
Synthesis for Multi-weighted Games with Branching-Time Winning Conditions
TLDR
This work encodes both problems to the calculation of maximal fixed points on dependency graphs, thus achieving on-the-fly algorithms with the possibility of early termination in both the model checking problem and the synthesis problem.
Controller Synthesis for MDPs and Frequency LTL\GU
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
Formally Reasoning About Quality
TLDR
Two quantitative extensions of Linear Temporal Logic are introduced, one by propositional quality operators and one by discounting operators, and the usefulness of both extensions is demonstrated and the decidability and complexity of the decision and search problems for them are studied.
Reasoning about CTL ∗ with Graded Path Modalities
TLDR
GCTL∗ is much more expressive than CTL∗ as it adds to it a form of quantitative reasoning, and this is done at no extra cost in computational complexity.
A Temporal Logic with Mean-Payoff Constraints
TLDR
This paper proposes an extension of LTL that describes mean-payoff constraints, and develops an algorithm for the emptiness problems of multi-dimensional payoff automata with Buchi acceptance conditions and multi-threshold mean- payoff acceptance conditions.
Weight monitoring with linear temporal logic: complexity and decidability
TLDR
This paper introduces an extension of linear time logic including past (LTL) with new operators that impose constraints on the accumulated weight along path fragments that cover properties expressible by several recently proposed formalisms.
Discounting in LTL
TLDR
One direction in this effort is to refine the “eventually” operators of temporal logic to discounting operators: the satisfaction value of a specification is a value in [0,1], where the longer it takes to fulfill eventuality requirements, the smaller the satisfactionvalue is.
Controller Synthesis for MDPs and Frequency LTL$$_{\setminus \mathbf{G}\mathbf U}$$
TLDR
This work studies frequency LTL fLTL, an extension of LTL which allows to speak about frequencies of events along an execution which is particularly useful for probabilistic systems that often cannot fulfil strict qualitative guarantees on the behaviour.
Quantitative Interprocedural Analysis
TLDR
The quantitative analysis problem for interprocedural control-flow graphs can be solved in polynomial time, and the framework provides a sound approach (no false positives) for the analysis of inefficiently-used containers.
...
...

References

SHOWING 1-10 OF 92 REFERENCES
Memoryful Branching-Time Logic
TLDR
It is shown that mCTL* is as expressive, but exponentially more succinct, than CTL*, and that the ability of m CTL* to refer to the present is essential for this equivalence.
Reasoning in a Restricted Temporal Logic
TLDR
It is shown that the satisfiability problem for RTL when interpreted over a real line is NP-complete and the class of ω-regular languages that are definable in RTL is characterized and simple translations between υ-regular sets and RTL formulae that define them are shown.
A really temporal logic
  • R. Alur, T. Henzinger
  • Computer Science
    30th Annual Symposium on Foundations of Computer Science
  • 1989
TLDR
TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis and several generalizations of TPTL are shown to be highly undecidable.
The Complexity of Mean-Payoff Automaton Expression
TLDR
This work proves that all the classical decision problems for mean-payoff expressions are PSPACE-complete, and improves the previously known 4EXPTIME upper bound.
Better Quality in Synthesis through Quantitative Objectives
TLDR
It is shown how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems, and how quantitative properties to measure the "goodness" of an implementation are used.
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract)
TLDR
This paper extends model-checking to stochastic real-time systems, whose behavior depends on probabilistic choice and quantitative time, with a model that can express constraints like “the delay between the request and the response is distributed uniformly between 2 to 4 seconds”.
Handbook of Weighted Automata
TLDR
This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications, and presents a detailed survey of the state of the art and pointers to future research.
On Omega-Languages Defined by Mean-Payoff Conditions
TLDR
This paper proposes the class of multi-threshold mean-payoff languages using acceptance conditions that are Boolean combinations of inequalities comparing the minimal or maximal accumulation point along some coordinate with a constant threshold.
Sometimes and Not Never Re-revisited: On Branching Versus Linear Time
TLDR
Two approaches that relate branching and linear model checking are described, one motivated by the fact that the alternation-free Μ-calculus, which is more expressive than CTL, has the same computational advantage as CTL when it comes to model checking.
...
...