“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Reasoning about infinite computations
Information and Computation
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Finite-state transducers in language and speech processing
Computational Linguistics
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Model checking discounted temporal properties
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Quantitative verification: models techniques and tools
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Handbook of Weighted Automata
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Quantitative synthesis for concurrent programs
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
What's decidable about weighted automata?
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Temporal Specifications with Accumulative Values
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Temporal-Logic-Based Reactive Mission and Motion Planning
IEEE Transactions on Robotics
Fuzzy branching temporal logic
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On temporal logic and signal processing
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.00 |
Traditional formal methods are based on a Boolean satisfaction notion: a reactive system satisfies, or not, a given specification. We generalize formal methods to also address the quality of systems. As an adequate specification formalism we introduce the linear temporal logic LTL[${\cal F}$]. The satisfaction value of an LTL[${\cal F}$] formula is a number between 0 and 1, describing the quality of the satisfaction. The logic generalizes traditional LTL by augmenting it with a (parameterized) set ${\cal F}$ of arbitrary functions over the interval [0,1]. For example, ${\cal F}$ may contain the maximum or minimum between the satisfaction values of subformulas, their product, and their average. The classical decision problems in formal methods, such as satisfiability, model checking, and synthesis, are generalized to search and optimization problems in the quantitative setting. For example, model checking asks for the quality in which a specification is satisfied, and synthesis returns a system satisfying the specification with the highest quality. Reasoning about quality gives rise to other natural questions, like the distance between specifications. We formalize these basic questions and study them for LTL[${\cal F}$]. By extending the automata-theoretic approach for LTL to a setting that takes quality into an account, we are able to solve the above problems and show that reasoning about LTL[${\cal F}$] has roughly the same complexity as reasoning about traditional LTL.