CSL model checking of deterministic and stochastic Petri nets

J.M. Martinez Verdugo, Boudewijn R.H.M. Haverkort, R. German, A. Heindl (Editor)

Research output: Other contribution


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.
Original languageEnglish
PublisherVDE Verlag GMBH
Number of pages18
Place of PublicationBerlin
ISBN (Print)978-3-8007-2945-6
Publication statusPublished - 2006
Externally publishedYes


  • EWI-8992
  • METIS-237894
  • IR-66852


Dive into the research topics of 'CSL model checking of deterministic and stochastic Petri nets'. Together they form a unique fingerprint.

Cite this