Results 171 to 180 of about 3,818 (217)
Some of the next articles are maybe not open access.
2000
The goal of this paper is to provide an introduction, with various elements of novelty, to the Planning as Model Checking paradigm.
Giunchiglia, Fausto, P. Traverso
openaire +3 more sources
The goal of this paper is to provide an introduction, with various elements of novelty, to the Planning as Model Checking paradigm.
Giunchiglia, Fausto, P. Traverso
openaire +3 more sources
2011 Workshop-School on Theoretical Computer Science, 2011
Model Checking is a technique to prove a concurrent system finite model satisfies a given property. Largely used to prove hardware systems correct, new techniques allow its use also to verify software systems. This paper aims to present a tutorial overview of the fundamental principles of model checking, as presented in the WEIT 2011.
openaire +2 more sources
Model Checking is a technique to prove a concurrent system finite model satisfies a given property. Largely used to prove hardware systems correct, new techniques allow its use also to verify software systems. This paper aims to present a tutorial overview of the fundamental principles of model checking, as presented in the WEIT 2011.
openaire +2 more sources
1999
Model checking is traditionally applied to computer system design. It has proven to be a valuable technique. However, it requires detailed specifications of systems and requirements, and is therefore not very accessible. In this paper we show how model checking can be applied in the context of business modeling and analysis by people that are not ...
Janssen, W. +4 more
openaire +3 more sources
Model checking is traditionally applied to computer system design. It has proven to be a valuable technique. However, it requires detailed specifications of systems and requirements, and is therefore not very accessible. In this paper we show how model checking can be applied in the context of business modeling and analysis by people that are not ...
Janssen, W. +4 more
openaire +3 more sources
2003
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing system safety by uncovering safety flaws and weaknesses of the system. The main drawback of this analysis technique is, that it is based on informal grounds, so safety flaws may ...
Thums, Andreas, Schellhorn, Gerhard
openaire +3 more sources
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing system safety by uncovering safety flaws and weaknesses of the system. The main drawback of this analysis technique is, that it is based on informal grounds, so safety flaws may ...
Thums, Andreas, Schellhorn, Gerhard
openaire +3 more sources
Formal Methods in System Design, 1993
We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In many cases we are able to obtain significant, even exponential, savings in the complexity of model checking.
E. Allen Emerson, A. Prasad Sistla
openaire +2 more sources
We show how to exploit symmetry in model checking for concurrent systems containing many identical or isomorphic components. We focus in particular on those composed of many isomorphic processes. In many cases we are able to obtain significant, even exponential, savings in the complexity of model checking.
E. Allen Emerson, A. Prasad Sistla
openaire +2 more sources
Checking and Distributing Statistical Model Checking
2012In this paper we propose a general framework for distributed statistical model checking of networks of priced timed automata. The first contribution is a new algorithm to distribute sequential hypothesis testing without introducing bias in the results. The second contribution is an implementation of this algorithm in Uppaal.
Peter E. Bulychev +5 more
openaire +2 more sources
Model checking for performability
Mathematical Structures in Computer Science, 2013This paper gives a bird's-eye view of the various ingredients that make up a modern, model-checking-based approach to performability evaluation: Markov reward models, temporal logics and continuous stochastic logic, model-checking algorithms, bisimulation and the handling of non-determinism.
Christel Baier +4 more
openaire +3 more sources
Proceedings of the second international joint conference on Autonomous agents and multiagent systems, 2003
This paper introduces ASF, a variation of the BDI logic programming language ASL intended to permit the model-theoretic verification of multi-agent systems. After briefly introducing ASF and discussing its relationship to ASL, we show how ASF programs can be transformed into Prm, the model specification language for the Spin model-checking system.
Rafael H. Bordini +3 more
openaire +1 more source
This paper introduces ASF, a variation of the BDI logic programming language ASL intended to permit the model-theoretic verification of multi-agent systems. After briefly introducing ASF and discussing its relationship to ASL, we show how ASF programs can be transformed into Prm, the model specification language for the Spin model-checking system.
Rafael H. Bordini +3 more
openaire +1 more source
1994
Fitting data by a certain generalized linear model means choosing appropriate forms for the predictor, the link function, and the exponential family or variance function. In the previous chapters Pearsons’s X 2, the deviance and, in the multinomial case, the power-divergence family were introduced as general goodness-of-fit statistics.
Ludwig Fahrmeir, Gerhard Tutz
openaire +1 more source
Fitting data by a certain generalized linear model means choosing appropriate forms for the predictor, the link function, and the exponential family or variance function. In the previous chapters Pearsons’s X 2, the deviance and, in the multinomial case, the power-divergence family were introduced as general goodness-of-fit statistics.
Ludwig Fahrmeir, Gerhard Tutz
openaire +1 more source
30th Annual International Computer Software and Applications Conference (COMPSAC'06), 2006
We have proposed inductive model checking (IMC) to alleviate the state explosion problem in model checking. IMC divides the whole verification tasks into several sub-tasks, and applies the three inductive steps (basis, hypothesis, and induction) to verify a system with model checking.
Kuangnan Chang, David Chenho Kung
openaire +1 more source
We have proposed inductive model checking (IMC) to alleviate the state explosion problem in model checking. IMC divides the whole verification tasks into several sub-tasks, and applies the three inductive steps (basis, hypothesis, and induction) to verify a system with model checking.
Kuangnan Chang, David Chenho Kung
openaire +1 more source