Results 1  10
of
20,985
Towards Compositional CSL Model Checking
, 2004
"... The Continuous Stochastic Logic (CSL) is a powerful means to state properties which refer to Continuous Time Markov Chains (CTMCs). The verification of such properties on a model can be achieved through a suitable algorithm. In this doctoral thesis, the CSL logic has been considered and two major as ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The Continuous Stochastic Logic (CSL) is a powerful means to state properties which refer to Continuous Time Markov Chains (CTMCs). The verification of such properties on a model can be achieved through a suitable algorithm. In this doctoral thesis, the CSL logic has been considered and two major
CSL model checking for Generalized Stochastic Petri Nets
 In Proceedings of the 3rd International Conference on Quantitative Evaluation of Systems (QEST 2006). IEEE
, 2006
"... This paper presents a Continuous Stochastic Logic (CSL) modelchecking algorithm for Generalized Stochastic Petri Nets (GSPNs). CSL is a temporal logic defined over Continuous Time Markov Chains (CTMCs). GSPNs are a class of Stochastic Petri Nets in which sojourn times in states are either exponenti ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper presents a Continuous Stochastic Logic (CSL) modelchecking algorithm for Generalized Stochastic Petri Nets (GSPNs). CSL is a temporal logic defined over Continuous Time Markov Chains (CTMCs). GSPNs are a class of Stochastic Petri Nets in which sojourn times in states are either
CSL model checking of biochemical networks with interval decision diagrams
 in Proc. CMSB 2009. LNCS/LNBI 5688
, 2009
"... Abstract. This paper presents an Interval Decision Diagram based approach to symbolic CSL model checking of Continuous Time Markov Chains which are derived from stochastic Petri nets. Matrixvector and vectormatrix multiplication are the major tasks of exact analysis. We introduce a simple, but po ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
Abstract. This paper presents an Interval Decision Diagram based approach to symbolic CSL model checking of Continuous Time Markov Chains which are derived from stochastic Petri nets. Matrixvector and vectormatrix multiplication are the major tasks of exact analysis. We introduce a simple
CSL model checking for the GreatSPN tool
 In Proc. ISCIS 2004, LNCS 3280
, 2004
"... Abstract. CSL is a stochastic temporal logic that has been defined for continuoustime Markov chains, and that allows the checking of whether a single state, or a set of states, satisfies a given probabilistic condition defined over states or over apath of states. In this paper we consider the proble ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract. CSL is a stochastic temporal logic that has been defined for continuoustime Markov chains, and that allows the checking of whether a single state, or a set of states, satisfies a given probabilistic condition defined over states or over apath of states. In this paper we consider
CSL Model Checking of Deterministic and Stochastic Petri Nets
"... Abstract. Deterministic and Stochastic Petri Nets (DSPNs) are a widely used highlevel formalism for modeling discreteevent systems where events may occur either without consuming time, after a deterministic time, or after an exponentially distributed time. The underlying process defined by DSPNs, ..."
Abstract
 Add to MetaCart
of such properties requires the solution of the steadystate and transient probabilities of the underlying MRGP. We also address a number of semantic issues regarding the application of CSL on MRGP and provide numerical model checking algorithms for this logic. A prototype model checker, based on SPNica, is also
CSL Model Checking for Generalized Stochastic Petri Nets*
"... Abstract This paper presents a Continuous Stochastic Logic(C SL) modelchecking algorithm for Generalized Stochastic Petri Nets (GSPNs). C SL is a temporal logic defined over Continuous Time Markov Chains (CTMCs). GSPNs are a class of Stochastic Petri Nets in which sojourntimes in states are eithe ..."
Abstract
 Add to MetaCart
Abstract This paper presents a Continuous Stochastic Logic(C SL) modelchecking algorithm for Generalized Stochastic Petri Nets (GSPNs). C SL is a temporal logic defined over Continuous Time Markov Chains (CTMCs). GSPNs are a class of Stochastic Petri Nets in which sojourntimes in states
Backward Stochastic Bisimulation in CSL Model Checking\Lambda
"... Abstract Equivalence relations can be used to reduce the statespace of a system model, thereby permitting more efficient analysis. We study backward stochastic bisimulationin the context of model checking continuoustime Markov chains against Continuous Stochastic Logic (CSL) properties. While ther ..."
Abstract
 Add to MetaCart
Abstract Equivalence relations can be used to reduce the statespace of a system model, thereby permitting more efficient analysis. We study backward stochastic bisimulationin the context of model checking continuoustime Markov chains against Continuous Stochastic Logic (CSL) properties. While
Photon emission rate from atomic systems in the CSL model
, 707
"... We calculate the photon emission rate from a general atomic system in the massproportional CSL model. For an isolated charged particle emitting kilovolt gamma rays, our results agree with those obtained by Fu. For a neutral atomic system, photon emission is strongly suppressed for photon wavelength ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We calculate the photon emission rate from a general atomic system in the massproportional CSL model. For an isolated charged particle emitting kilovolt gamma rays, our results agree with those obtained by Fu. For a neutral atomic system, photon emission is strongly suppressed for photon
CSL model checking algorithms for infinitestate structured Markov chains
 In Formats ’07, number 4763 in LNCS
, 2007
"... Abstract. Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuoustime Markov chain (CTMC) that underlies such a JQN, is highly structured, however, of infinite size in as many dimensions a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
as there are queues. We present CSL model checking algorithms for labeled JQNs. To do so, we rely on wellknown productform results for the steadystate probabilities in (stable) JQNs. The transient probabilities are computed using an uniformizationbased approach. We develop a new notion of property independence
Results 1  10
of
20,985