Results 281 to 290 of about 221,743 (312)
Some of the next articles are maybe not open access.
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 +2 more sources
International Journal on Software Tools for Technology Transfer, 2011
Regular model checking has been studied extensively during recent years as a framework for algorithmic verification of systems with infinite state spaces. We describe the main concepts of the framework, and some of its applications.
openaire +1 more source
Regular model checking has been studied extensively during recent years as a framework for algorithmic verification of systems with infinite state spaces. We describe the main concepts of the framework, and some of its applications.
openaire +1 more source
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
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
International Journal of Foundations of Computer Science, 2006
This paper shows how to perform model checking, a technique for automatic program verification, by a DNA algorithm. Our method depends on two ideas. First, Kripke structures can be compactly represented in a DNA substrate, coding each state and each edge by a strand of DNA.
E. Allen Emerson +2 more
openaire +1 more source
This paper shows how to perform model checking, a technique for automatic program verification, by a DNA algorithm. Our method depends on two ideas. First, Kripke structures can be compactly represented in a DNA substrate, coding each state and each edge by a strand of DNA.
E. Allen Emerson +2 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
Model checking and equivalence checking
2009Introduction Owing to the advances in semiconductor technology, a large and complex system that has a wide variety of functionalities has been integrated on a single chip. It is called system-on-a-chip (SoC) or system LSI , since all of the components in an electronics system are built on a single chip.
openaire +1 more source
2003
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” but it also appears in many other situations. By considering several extended temporal logics, we show that the problem of model checking a path can usually be solved efficiently ...
Nicolas Markey, Philippe Schnoebelen
openaire +1 more source
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” but it also appears in many other situations. By considering several extended temporal logics, we show that the problem of model checking a path can usually be solved efficiently ...
Nicolas Markey, Philippe Schnoebelen
openaire +1 more source