Model Checking Quantitative Linear Time Logic
TL;DR: This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLTL over quantitative versions of Kripke structures and Markov chains.
read more
About: This article is published in Electronic Notes in Theoretical Computer Science. The article was published on 01 Dec 2008. and is currently open access. The article focuses on the topics: Model checking & Linear temporal logic.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Formalizing and reasoning about quality
Shaull Almagor,Udi Boker,Orna Kupferman +2 more
- 08 Jul 2013
TL;DR: 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.
•Posted Content
Discounting in LTL
TL;DR: 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.
Synthesis of Controllable Nash Equilibria in Quantitative Objective Game
Shaull Almagor,Orna Kupferman,Giuseppe Perelli +2 more
- 01 Jul 2018
TL;DR: This paper extends rational synthesis to LTL[F] -- an extension of LTL by quality operators -- and shows that the cooperative and non-cooperative versions of quantitative rational synthesis are 2EXPTIME-complete and in 3EXPTime, respectively -- not harder than the complexity known for their Boolean analogues.
Quantitative Assume Guarantee Synthesis
Shaull Almagor,Orna Kupferman,Jan Oliver Ringert,Yaron Velner +3 more
- 24 Jul 2017
TL;DR: Researchers have identified the \(\text {GR(1)}\) fragment of LTL, which supports assume-guarantee reasoning and for which synthesis has an efficient symbolic solution.
Weighted LTL with discounting
Eleni Mandrali
- 17 Jul 2012
TL;DR: It is proved that every ω-recognizable series with discounting is the image of a series definable by a formula of this syntactic fragment through a strict alphabetic epimorphism.
16
References
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
7.5K
The temporal logic of programs
Amir Pnueli
- 30 Sep 1977
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
5.8K
The theory of hybrid automata
Thomas A. Henzinger
- 27 Jul 1996
TL;DR: The goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
2.3K
An Automata-Theoretic Approach to Automatic Program Verification
Moshe Y. Vardi,Pierre Wolper +1 more
- 01 Jan 1986
1.6K
A logic for reasoning about time and reability
Hans Hansson,Bengt Jonsson +1 more
TL;DR: This work presents a logic for stating properties such as, “after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds” and gives algorithms for checking that a given Markov chain satisfies a formula in the logic.
Related Papers (5)
Shaull Almagor,Udi Boker,Orna Kupferman +2 more
- 08 Jul 2013
Amir Pnueli,Roni Rosner +1 more
- 03 Jan 1989
Moshe Y. Vardi,Pierre Wolper +1 more
- 01 Jan 1986
Moshe Y. Vardi,Pierre Wolper +1 more