Petri Net Analysis Using Decision Diagrams

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.

[1]  Gianfranco Ciardo,et al.  Symbolic Reachability Analysis of Integer Timed Petri Nets , 2009, SOFSEM.

[2]  Gianfranco Ciardo,et al.  Implicit data structures for logic and stochastic systems analysis , 2005, PERV.

[3]  Gianfranco Ciardo,et al.  Saturation Unbound , 2003, TACAS.

[4]  Gianfranco Ciardo,et al.  The saturation algorithm for symbolic state-space exploration , 2006, International Journal on Software Tools for Technology Transfer.

[5]  Andrew S. Miner,et al.  Comparing implicit representations of large CTMCs , 2003 .

[6]  Gianfranco Ciardo,et al.  Exploiting interleaving semantics in symbolic state-space generation , 2007, Formal Methods Syst. Des..

[7]  Gianfranco Ciardo,et al.  Structural Symbolic CTL Model Checking of Asynchronous Systems , 2003, CAV.

[8]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[9]  Gianfranco Ciardo,et al.  Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams , 2009, SOFSEM.

[10]  Peter Buchholz,et al.  Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models , 2000, INFORMS J. Comput..

[11]  Gianfranco Ciardo,et al.  P-Semiflow Computation with Decision Diagrams , 2009, Petri Nets.

[12]  Gianfranco Ciardo,et al.  Data Representation and Efficient Solution: A Decision Diagram Approach , 2007, SFM.

[13]  Gianfranco Ciardo,et al.  Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation , 2001, TACAS.

[14]  Gianfranco Ciardo,et al.  Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths , 2002, FMCAD.

[15]  Gianfranco Ciardo,et al.  Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning , 2005, CHARME.

[16]  Gianfranco Ciardo,et al.  A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis , 2006, ATVA.