Model Checking Quantitative Linear Time Logic

Authors:
Marco Faella;Axel Legay;Mariëlle Stoelinga
Affiliations:
Università di Napoli “Federico II”, Italy;University of Liège, Belgium;University of Twente, The Netherlands
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 18
Cited 2

A theory of timed automata

Theoretical Computer Science
The complexity of probabilistic verification

Journal of the ACM (JACM)
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Model-checking infinite state-space systems with fine-grained abstractions using SPIN

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Constructing automata from temporal logic formulas: a tutorial

Lectures on formal methods and performance analysis
Simple on-the-fly automatic verification of linear temporal logic

Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Model Checking of Probabalistic and Nondeterministic Systems

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Approximating Labeled Markov Processes

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Model Checking Probabilistic Pushdown Automata

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Model checking discounted temporal properties

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems

QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Game-based Abstraction for Markov Decision Processes

QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Game Relations and Metrics

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
The Büchi complementation saga

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Don’t know in probabilistic systems

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

Weighted LTL with discounting

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Formalizing and reasoning about quality

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.