Author: Prof. Gianfranco Ciardo
Department of Computer Science and Engineering, University of California, Riverside, USA,
ciardo@cs.ucr.edu
Abstract: Motivated by the need to analyze Petri nets, timed Petri nets, and stochastic Petri nets with very large reachability graphs, this tutorial provides an introduction to several important classes of decision diagrams, going well beyond the well-known BDDs, as well as the algorithms to manipulate them. The considered applications include reachability-set generation, CTL model checking, and p-semiflow analysis for ordinary Petri nets, numerical solution of stochastic Petri nets describing an underlying Markov chain, and reachability analysis for integer-timed Petri nets.
Tutorial Outline:
The study of complex discrete-state systems often requires the analysis and manipulation of very large
data structures such as sets and relations, or vector and matrices. Recent advances in the area of decision
diagrams have made possible the analysis of truly enormous systems, thanks to their ability to compactly
encode the required structures in many cases. This full-day tutorial covers these advances in so-called
symbolic methods and their impact on the analysis of various classes of Petri nets. Of course, many high-level formalisms commonly used to model discrete systems can also benefit from using decision diagrams.
Intended audience: The proposed tutorial is targeted at Petri net researchers and practitioners who have an interest in the analysis of very large and complex discrete systems. While a minimal familiarity with basic concepts of Petri net analysis is assumed, all required Petri net definitions, properties, and algorithms will be briefly summarized. Researchers with knowledge of BDDs and their use for symbolic verification (but not of more advanced decision diagram variants and algorithms) may find this tutorial particularly stimulating.
Previous venues:
Courses and tutorials on decision diagrams were delivered at 2005 Bertinoro ISS, Decision diagrams and
their applications (15 hours, 3 hours per day for 5 days); QEST 2005, Decision diagrams for logic and
stochastic modeling (3 hours); SIGMETRICS 2006, Symbolic encodings for stochastic processes (3 hours),
and QEST 2009, Petri net analysis using decision diagrams (3 hours).
The main difference with respect to the above courses, except the 3-hour QEST 2009 tutorial, is the much
stronger emphasis on Petri nets. This emphasis is due to several factors:
Another difference from past tutorials is the intention to completely drop the topic of Kronecker encodings which, while related and historically relevant, have now been completely subsumed by more elegant and powerful decision diagram encodings. This will leave more time for the core concepts.
Speaker's biography:
Gianfranco Ciardo is a Professor in the Department of Computer Science and Engineering at the University
of California, Riverside. He holds a PhD in Computer Science from Duke University and a Laurea in Scienze
dell' Informazione from the University of Torino. He has been Visiting Faculty at HP Labs, University of
Torino, TU Berlin, ICASE, and National Institute of Aerospace. Prior to joining academia, he worked at
Software Productivity Consortium, and CSELT. His interests are logic verification and stochastic modeling,
performance and reliability evaluation of hardware/software systems, symbolic model checking, Markov
models, discrete-event simulation, and Petri nets. He has published more than 100 papers in journals and
conferences, has been on the editorial board of IEEE Transactions on Software Engineering, and is on the
editorial board of Transactions on Petri Nets and Other Models of Concurrency. He was a keynote speaker
at PNPM 2001, Petri Nets 2004, EPEW/WS-FM 2005, and PDMC 2009.