Deterministic and Stochastic Petri Nets (DSPNs) are a widely
used high-level formalism for modeling discrete-event systems where events may occur either without consuming time, after a deterministic time, or after an exponentially distributed time. The underlying process dened by DSPNs, under certain restrictions, corresponds to a class of Markov
Regenerative Stochastic Processes (MRGP). In this paper, we investigate the use of CSL (Continuous Stochastic Logic) to express probabilistic properties, such a time-bounded until and time-bounded next, at the DSPN level. The verification of such properties requires the solution of the steady-state 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 described.
|Conference||Proceedings 13th GI/ITG conference on measuring, Modelling and Evaluation of Computer and Communication Systems|
|Period||27/03/06 → 29/03/06|
|Other||March 27-29, 2006|