Results 291 to 300 of about 1,133,638 (315)
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.
Baier C. +4 more
openaire +3 more sources
[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 2003
Abstract: "We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. Thegoal is to check properties of the components of a system and then deduce globalproperties from these local properties.
Kenneth L. McMillan +2 more
openaire +2 more sources
Abstract: "We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. Thegoal is to check properties of the components of a system and then deduce globalproperties from these local properties.
Kenneth L. McMillan +2 more
openaire +2 more sources
2023
In this chapter, we are going to learn about model-checking with mCRL2. Model-checking is the activity of checking properties of a given behaviour. In the context of software engineering such properties are also called requirements that express expected behaviours from the behavioural description.
Muhammad Atif, Jan Friso Groote
openaire +2 more sources
In this chapter, we are going to learn about model-checking with mCRL2. Model-checking is the activity of checking properties of a given behaviour. In the context of software engineering such properties are also called requirements that express expected behaviours from the behavioural description.
Muhammad Atif, Jan Friso Groote
openaire +2 more sources
1996
Model checking is an automatic technique for verifying finite-state reactive systems, such as sequential circuit designs and communication protocols.
Clarke, Edmund M, O. Grumberg, D. Long
openaire +1 more source
Model checking is an automatic technique for verifying finite-state reactive systems, such as sequential circuit designs and communication protocols.
Clarke, Edmund M, O. Grumberg, D. Long
openaire +1 more source
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 +1 more source
Model checking for survivability!
Second International Conference on the Quantitative Evaluation of Systems (QEST'05), 2005Business and social life have become increasingly dependent on large-scale communication and information systems. A partial or complete breakdown as a consequence of natural disasters or purposeful attacks might have severe impacts. Survivability refers to the ability of a system to recover from such disaster circumstances.
L. Cloth, Boudewijn R. Haverkort
openaire +2 more sources
Model Checking for Managers [PDF]
, 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 ...
Petra van der Stappen +4 more
openaire +2 more sources
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
2003
Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last decade for formally verifying finite state systems such as sequential circuits and protocols. Since its introduction in the beginning of the 90’s, it has been integrated in the quality assurance process of several major hardware companies.
Armin Biere +4 more
openaire +3 more sources
Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last decade for formally verifying finite state systems such as sequential circuits and protocols. Since its introduction in the beginning of the 90’s, it has been integrated in the quality assurance process of several major hardware companies.
Armin Biere +4 more
openaire +3 more sources
Checking security properties by model checking
Software Testing, Verification and Reliability, 2003AbstractA method is proposed for checking security properties in programs written in high‐level languages. The method is based on the model checking technique. The SMV tool is used. The representation of the program is a Kripke structure modelling the control flow graph enriched with security information.
DE FRANCESCO, NICOLETTA +1 more
openaire +2 more sources