P-Semiflow Computation with Decision Diagrams

Authors:
Gianfranco Ciardo;Galen Mecham;Emmanuel Paviot-Adet;Min Wan
Affiliations:
Dept. of Computer Science and Engineering, Univ. of California, Riverside;Dept. of Computer Science and Engineering, Univ. of California, Riverside;Université P. & M. Curie, LIP6 - CNRS UMR, Paris, France 7606 and Universitééé Paris Descartes, Inst. Univ. de Technologie, Paris, France;Yahoo! Inc.,
Venue:
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Year:
2009

Citing 8
Cited 2

Predicate/transition nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Improving the linearly based characterization of P/T nets

APN 90 Proceedings on Advances in Petri nets 1990
GreatSPN 1.7: graphical editor and analyzer for timed and stochastic Petri nets

Performance Evaluation - Special issue: performance modeling tools
Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows

Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
Petri Net Analysis Using Boolean Manipulation

Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Timed Petri net models of multithreaded multiprocessor architectures

PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Logic and stochastic modeling with SMART

Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

Steady-state solution of biochemical systems, beyond S-systems via T-invariants

Proceedings of the 8th International Conference on Computational Methods in Systems Biology
Ten years of saturation: a petri net perspective

Transactions on Petri Nets and Other Models of Concurrency V

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farkas' algorithm, and compute a generator set from which any p-semiflow for the Petri net can be derived through a linear combination. We demonstrate the effectiveness of four variants of our algorithm by applying them on a suite of Petri net models, showing that our symbolic approach can produce results in cases where the explicit approach is infeasible.