By Topic

Petri Net Analysis Using Decision Diagrams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gianfranco Ciardo ; Dept. of Comput. Sci. & Eng., Univ. of California, Riverside, Riverside, CA, USA

This tutorial provides an introduction to the most important classes of decision diagrams and their applications in the area of verification and stochastic or timed modeling. In particular, we show how structured representations can greatly reduce the memory and time required for state-space generation, CTL model checking, numerical solution of Markov chains, and reachability analysis of nondeterministic integer-timed models. We use Petri nets (PNs) as the high-level model specification language, but the algorithms and data-structures presented are widely applicable to many other formalisms commonly used to describe discrete-state systems.

Published in:

Quantitative Evaluation of Systems, 2009. QEST '09. Sixth International Conference on the

Date of Conference:

13-16 Sept. 2009