Sciweavers

698 search results - page 12 / 140
» Model Checking with Multi-valued Logics
Sort
View
CONCUR
2006
Springer
13 years 9 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
VVEIS
2007
13 years 8 months ago
Checking Properties of Business Process Models with Logic Programming
Logic programming has been successfully used for reasoning about various kinds of models. However, in the area of business-process modeling it has not yet gained the attention it d...
Volker Gruhn, Ralf Laue
TACAS
2001
Springer
125views Algorithms» more  TACAS 2001»
13 years 11 months ago
Coverage Metrics for Temporal Logic Model Checking
In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complet...
Hana Chockler, Orna Kupferman, Moshe Y. Vardi
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Model Checking Quantitative Linear Time Logic
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.
Marco Faella, Axel Legay, Mariëlle Stoelinga
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla