Results 301 to 310 of about 1,133,638 (315)
Some of the next articles are maybe not open access.
Formal Methods in System Design, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Geist +3 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Geist +3 more
openaire +3 more sources
Model checking multiagent systems
Journal of Logic and Computation, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Benerecetti +2 more
openaire +4 more sources
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 +2 more sources
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 +2 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 +2 more sources
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 +2 more sources
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 +2 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.
A. Prasad Sistla, E. Allen Emerson
openaire +3 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.
A. Prasad Sistla, E. Allen Emerson
openaire +3 more sources
1979
Suppose that we have observations from n independent repetitions of an experiment. We wish to determine how well these data agree with a probability model for the experiment. We do this by comparing observed values from the experiment with corresponding theoretical values derived from the model.
openaire +2 more sources
Suppose that we have observations from n independent repetitions of an experiment. We wish to determine how well these data agree with a probability model for the experiment. We do this by comparing observed values from the experiment with corresponding theoretical values derived from the model.
openaire +2 more sources
Model checking and abstraction
ACM Transactions on Programming Languages and Systems, 1992We describe a method for using abstraction to reduce the complexity of temporal-logic model checking. Using techniques similar to those involved in abstract interpretation, we construct an abstract model of a program without ever examining the corresponding unabstracted model.
Edmund M. Clarke +2 more
openaire +3 more sources