Sciweavers

713 search results - page 16 / 143
» Model Checking and Transitive-Closure Logic
Sort
View
LMCS
2007
132views more  LMCS 2007»
14 years 10 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
ECAI
1998
Springer
15 years 3 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
ENTCS
2007
109views more  ENTCS 2007»
14 years 10 months ago
Symbolic Model Checking for Channel-based Component Connectors
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
Sascha Klüppelholz, Christel Baier
VMCAI
2010
Springer
15 years 8 months ago
Advances in Probabilistic Model Checking
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...
Joost-Pieter Katoen
FM
2001
Springer
142views Formal Methods» more  FM 2001»
15 years 3 months ago
Model-Checking over Multi-valued Logics
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
Marsha Chechik, Steve M. Easterbrook, Victor Petro...