KReach : a tool for reachability in petri nets

We present KReach, a tool for deciding reachability in general Petri nets. The tool is a full implementation of Kosaraju’s original 1982 decision procedure for reachability in VASS. We believe this to be the first implementation of its kind. We include a comprehensive suite of libraries for development with Vector Addition Systems (with States) in the Haskell programming language. KReach serves as a practical tool, and acts as an effective teaching aid for the theory behind the algorithm. Preliminary tests suggest that there are some classes of Petri nets for which we can quickly show unreachability. In particular, using KReach for coverability problems, by reduction to reachability, is competitive even against state-of-the-art coverability checkers

Dependability Analysis of Control Systems using SystemC and Statistical Model Checking

Stochastic Petri nets are commonly used for modeling distributed systems in order to study their performance and dependability. This paper proposes a realization of stochastic Petri nets in SystemC for modeling large embedded control systems. Then statistical model checking is used to analyze the dependability of the constructed model. Our verification framework allows users to express a wide range of useful properties to be verified which is illustrated through a case study

Production system identification with genetic programming

Modern system-identification methodologies use artificial neural nets, integer linear programming, genetic algorithms, and swarm intelligence to discover system models. Pairing genetic programming, a variation of genetic algorithms, with Petri nets seems to offer an attractive, alternative means to discover system behaviour and structure. Yet to date, very little work has examined this pairing of technologies. Petri nets provide a grey-box model of the system, which is useful for verifying system behaviour and interpreting the meaning of operational data. Genetic programming promises a simple yet robust tool to search the space of candidate systems. Genetic programming is inherently highly parallel. This paper describes early experiences with genetic programming of Petri nets to discover the best interpretation of operational data. The systems studied are serial production lines with buffers

Verifying Modal Workflow Specifications Using Constraint Solving

International audienceNowadaysworkflowsareextensivelyusedbycompaniestoimproveorganizationalefficiencyandproductivity.Thispaperfocusesontheverificationofmodalworkflowspecificationsusingconstraintsolvingasacomputationaltool.ItsmaincontributionconsistsindevelopinganinnovativeformalframeworkbasedonconstraintsystemstomodelexecutionsofworkflowPetrinetsandtheirstructuralproperties,aswellastoverifytheirmodalspecifications.Finally,animplementationandpromisingexperimentalresultsconstituteapracticalcontribution

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes

We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing occurrences of processes) are colored by values over some potentially infinite data domain such as integers, reals, etc. Furthermore, we define a logic, called CML (colored markings logic), for the description of CPN configurations. CML is a first-order logic over tokens allowing to reason about their locations and their colors. Both CPNs and CML are parametrized by a color logic allowing to express constraints on the colors (data) associated with tokens. We investigate the decidability of the satisfiability problem of CML and its applications in the verification of CPNs. We identify a fragment of CML for which the satisfiability problem is decidable (whenever it is the case for the underlying color logic), and which is closed under the computations of post and pre images for CPNs. These results can be used for several kinds of analysis such as invariance checking, pre-post condition reasoning, and bounded reachability analysis.Comment: 29 pages, 5 tables, 1 figure, extended version of the paper published in the the Proceedings of TACAS 2007, LNCS 442