Sciweavers

1138 search results - page 47 / 228
» First-Order Model Checking Problems Parameterized by the Mod...
Sort
View
TACAS
2004
Springer
132views Algorithms» more  TACAS 2004»
14 years 1 months ago
Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study
Numerical analysis based on uniformisation and statistical techniques based on sampling and simulation are two distinct approaches for transient analysis of stochastic systems. We ...
Håkan L. S. Younes, Marta Z. Kwiatkowska, Ge...
ICST
2009
IEEE
13 years 5 months ago
An Evaluation of Model Checkers for Specification Based Test Case Generation
Under certain constraints the test case generation problem can be represented as a model checking problem, thus enabling the use of powerful model checking tools to perform the te...
Gordon Fraser, Angelo Gargantini
UC
2005
Springer
14 years 1 months ago
On Model-Checking of P Systems
Abstract. Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computin...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
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
ECAI
1998
Springer
13 years 12 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