Abstract. 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 objectoriented 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.
MotivationConsidering efficient implementations of model checking tools for Petri nets, most research efforts so far are aimed at techniques for 1-bounded nets.Reports on applying symbolic techniques to k-bounded nets can be occasionally found in the literature, but the only available tool implementing symbolic CTL model checking is SMART [CS03]. Though every bounded net can be simulated by a 1-bounded net, in practice the transformation is generally complicated and produces huge nets which can no longer be efficiently analysed.However, biochemical networks in systems and synthetic biology often result in k-bounded models, caused by stoichiometry and the number of molecules or discrete concentration levels involved; see e.g.Many of these models could not be analysed by existing model checking tools and new techniques were required. This paper gives an overview on the basic functionality of our new symbolic analysis tool that supports the efficient analysis of 1-bounded (zbdd-mc) and kbounded (idd-mc) Petri nets extended by four non-standard arc types. It replaces our former symbolic CTL model checker of 1-bounded place/transition Petri nets [Noa99], which has been part of the model checking kit [SSE03] for quite a while.We deliberately confine ourselves to an informal presentation; see [Tov08] for more detailed information concerning data structures and algorithms, as well as all related formal definitions.