Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Efficient Reachability Set Generation and Storage Using Decision Diagrams
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Snoopy: a tool to design and animate/simulate graph-based formalisms
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Petri nets for systems and synthetic biology
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
From petri nets to differential equations – an integrative approach for biochemical network analysis
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
CSL Model Checking of Biochemical Networks with Interval Decision Diagrams
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
A comparative study of stochastic analysis techniques
Proceedings of the 8th International Conference on Computational Methods in Systems Biology
IDD-based model validation of biochemical networks
Theoretical Computer Science
Preface: Petri nets for Systems and Synthetic Biology
Natural Computing: an international journal
How might petri nets enhance your systems biology toolkit
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Preface: Petri nets for Systems and Synthetic Biology
Natural Computing: an international journal
Computing a hierarchical static order for decision diagram-based representation from p/t nets
Transactions on Petri Nets and Other Models of Concurrency V
Hi-index | 0.00 |
DSSZ-MC supports the symbolic analysis of bounded place/ transition Petri nets extended by read, inhibitor, equal, and reset arcs. No previous knowledge of the precise boundedness degree is required. It contains tools for the efficient analysis of standard properties (boundedness, liveness, reversibility) and CTL model checking, built on an object-oriented implementation of Zero-suppressed Binary Decision Diagrams and Interval Decision Diagrams. The main features are saturation-based state space generation, analysis of strongly connected components, dead state analysis with trace generation, and CTL model checking by limited backward reachability analysis. The tool is available for Windows, Linux, and Mac/OS.