POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Design and validation of computer protocols
Design and validation of computer protocols
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Model checking
Alternating-time temporal logic
Journal of the ACM (JACM)
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Conter Machines: Decidable Properties and Applications to Verification Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
An algebraic approach to data languages and timed languages
Information and Computation
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Reasoning about online algorithms with weighted automata
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Reasoning about online algorithms with weighted automata
ACM Transactions on Algorithms (TALG)
Quantitative generalizations of languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
ACM Transactions on Computational Logic (TOCL)
ACM Computing Surveys (CSUR)
Coping with selfish on-going behaviors
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Coping with selfish on-going behaviors
Information and Computation
Measuring and synthesizing systems in probabilistic environments
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Recent challenges and ideas in temporal synthesis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Quantitative Analysis of Systems Using Game-Theoretic Learning
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Rigorous approximated determinization of weighted automata
Theoretical Computer Science
Hi-index | 0.00 |
We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have integer values at states, and properties have integer values on traces. For example, the value of a quantitative proposition at a state may represent power consumed at the state, and the value of a quantitative property on a trace may represent energy used along the trace. The value of a quantitative property at a state, then, is the maximum (or minimum) value achievable over all possible traces from the state. In this framework, model checking can be used to compute, for example, the minimum battery capacity necessary for achieving a given objective, or the maximal achievable lifetime of a system with a given initial battery capacity. In the case of open systems, these problems require the solution of games with integer values. Quantitative model checking and game solving is undecidable, except if bounds on the computation can be found. Indeed, many interesting quantitative properties, like minimal necessary battery capacity and maximal achievable lifetime, can be naturally specified by quantitative-bound automata, which are finite automata with integer registers whose analysis is constrained by a bound function f that maps each system K to an integer f(K). Along with the linear-time, automaton-based view of quantitative verification, we present a corresponding branching-time view based on a quantitative-bound μ-calculus, and we study the relationship, expressive power, and complexity of both views.