Javascript must be enabled to continue!
Bounded Model Checking of Continuous Stochastic Logic
View through CrossRef
Model checking continuous stochastic logic has been proven to be a
powerful technique for analyzing the dependability and performance of
stochastic systems. The state space explosion is the main obstacle
making the technique more practical. To avoid the state explosion, a
bounded model checking technique of continuous stochastic logic is
proposed. First of all, the bounded semantics of continuous stochastic
logic is presented, and its correctness is proven. Secondly, an
effective method for computing the transient probability and
steady-state probability bounded by the path length is proposed.
Finally, for different operators bounded model checking procedures based
on the computation of the transient probability and steady-state
probability bounded by the path length are proposed. The experiment
results show that if the property can be verified in local reachable
space with small depth, then the bounded model checking is better than
global model checking in time and space consumption.
Title: Bounded Model Checking of Continuous Stochastic Logic
Description:
Model checking continuous stochastic logic has been proven to be a
powerful technique for analyzing the dependability and performance of
stochastic systems.
The state space explosion is the main obstacle
making the technique more practical.
To avoid the state explosion, a
bounded model checking technique of continuous stochastic logic is
proposed.
First of all, the bounded semantics of continuous stochastic
logic is presented, and its correctness is proven.
Secondly, an
effective method for computing the transient probability and
steady-state probability bounded by the path length is proposed.
Finally, for different operators bounded model checking procedures based
on the computation of the transient probability and steady-state
probability bounded by the path length are proposed.
The experiment
results show that if the property can be verified in local reachable
space with small depth, then the bounded model checking is better than
global model checking in time and space consumption.
Related Results
Model-checking ecological state-transition graphs
Model-checking ecological state-transition graphs
AbstractModel-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as a state-transiti...
Bounded Correctness Checking of the Universal Fragment of eCTL
Bounded Correctness Checking of the Universal Fragment of eCTL
Bounded model checking as a complementary approach to BDD based symbolic model checking applies satisfiability checking to the verification of temporal properties, especially, for ...
Evolution of a course on model checking for practical applications
Evolution of a course on model checking for practical applications
Although model checking is expected as a practical formal verification approach for its automatic nature, it still suffers from difficulties in writing the formal descriptions to b...
Probabilistic Model Checking for Biology
Probabilistic Model Checking for Biology
Probabilistic model checking is an automated method for verifying the correctness and performance of probabilistic models. Property specifications are expressed in probabilistic te...
Clock monitoring is associated with age-related decline in time-based prospective memory
Clock monitoring is associated with age-related decline in time-based prospective memory
AbstractIn laboratory time-based prospective memory tasks, older adults typically perform worse than younger adults do. It has been suggested that less frequent clock checking due ...
Monadic Bounded Algebras
Monadic Bounded Algebras
<p>The object of study of the thesis is the notion of monadic bounded algebras (shortly, MBA's). These algebras are motivated by certain natural constructions in free (first-...
Hodge–Dirac, Hodge-Laplacian and Hodge–Stokes operators in $L^p$ spaces on Lipschitz domains
Hodge–Dirac, Hodge-Laplacian and Hodge–Stokes operators in $L^p$ spaces on Lipschitz domains
This paper concerns Hodge–Dirac operators
D_{{}^\Vert}=d+\underline{\delta}
acting in
L^p(\Omega, ...
Rationality and Logic
Rationality and Logic
An argument that logic is intrinsically psychological and human psychology is intrinsically logical, and that the connection between human rationality and logic is both constitutiv...

