Model Checking Quantitative Linear Time Logic

DOI10.1016/j.entcs.2008.11.019zbMath1286.68313OpenAlexW2128746993MaRDI QIDQ5415664

Axel Legay, Mariëlle I. A. Stoelinga, Marco Faella

Publication date: 13 May 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.11.019

zbMATH Keywords

automatalinear temporal logicquantitative verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Symbolic Model Checking in Non-Boolean Domains, Multi-Valued Reasoning about Reactive Systems, Weighted LTL with Discounting, On the complexity of verification of time-sensitive distributed systems, Latticed-LTL synthesis in the presence of noisy inputs, Quantitative vs. weighted automata, Synthesis from component libraries with costs, On High-Quality Synthesis

Uses Software

• LiQuor

Cites Work

• A theory of timed automata
• A logic for reasoning about time and reliability
• Model checking discounted temporal properties
• Model checking of probabilistic and nondeterministic systems
• The Büchi Complementation Saga
• The complexity of probabilistic verification
• Validation of Stochastic Systems
• An automata-theoretic approach to branching-time model checking
• Automata, Languages and Programming
• Testing and generating infinite sequences by a finite automaton
• Model Checking Software
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item