Results 11 to 20 of about 1,133,638 (315)
In this paper we investigate a potential use of fluid approximation techniques in the context of stochastic model checking of CSL formulae. We focus on properties describing the behaviour of a single agent in a (large) population of agents, exploiting a ...
Bortolussi, Luca, Hillston, Jane
core +6 more sources
Model checking usage policies [PDF]
We study usage automata, a formal model for specifying policies on the usage of resources. Usage automata extend finite state automata with some additional features, parameters and guards, that improve their expressivity.
Bartoletti M+3 more
core +9 more sources
On the Complexity of ATL and ATL* Module Checking [PDF]
Module checking has been introduced in late 1990s to verify open systems, i.e., systems whose behavior depends on the continuous interaction with the environment.
Laura Bozzelli, Aniello Murano
doaj +3 more sources
Model Checking: Verification or Debugging? [PDF]
We survey the basic principles behind the application of model checking to controller verification and synthesis. A promising development is the area of guided model checking, in which the state space search strategy of the model checking algorithm can ...
Brinksma, H., Ruys, T.C.
core +18 more sources
Compositional Stochastic Model Checking Probabilistic Automata via Assume-guarantee Reasoning
Stochastic model checking is the extension and generalization of the classical model checking. Compared with classical model checking, stochastic model checking faces more severe state explosion problem, because it combines classical model checking ...
Yang Liu, Rui Li
doaj +1 more source
Model checking C++ programs [PDF]
SummaryIn the last three decades, memory safety issues in system programming languages such as C or C++ have been one of the most significant sources of security vulnerabilities. However, there exist only a few attempts with limited success to cope with the complexity of C++ program verification.
Monteiro, Felipe R.+2 more
openaire +5 more sources
Model checking polygonal differential inclusions using invariance kernels [PDF]
Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. Here, we identify and compute an important object of such systems’ phase portrait, namely invariance kernels.
Fifth International Conference on Verification, Model Checking and Abstract Interpretation+2 more
core +1 more source
Geometric Model Checking of Continuous Space [PDF]
Topological Spatial Model Checking is a recent paradigm where model checking techniques are developed for the topological interpretation of Modal Logic. The Spatial Logic of Closure Spaces, SLCS, extends Modal Logic with reachability connectives that, in
Nick Bezhanishvili+5 more
doaj +1 more source
Checking RTECTL properties of STSs via SMT-based Bounded Model Checking
We present an SMT-based bounded model checking (BMC) method for Simply-Timed Systems (STSs) and for the existential fragment of the Real-time Computation Tree Logic. We implemented the SMT-based BMC algorithm and compared it with the SAT-based BMC method
Agnieszka Zbrzezny, Andrzej Zbrzezny
doaj +1 more source
Distributed Parametric and Statistical Model Checking [PDF]
Statistical Model Checking (SMC) is a trade-off between testing and formal verification. The core idea of the approach is to conduct some simulations of the system and verify if they satisfy some given property.
Peter Bulychev+4 more
doaj +1 more source