PIPE+Verifier - A Tool for Analyzing High Level Petri Nets

  title={PIPE+Verifier - A Tool for Analyzing High Level Petri Nets},
  author={Su Liu and Xudong He},
High level Petri nets (HLPNs) have been widely used to model complex systems; however, their high expressive power costs their analyzability. Model checking techniques have been exploited in analyzing high level Petri nets, but have limited success due to either undecidability problem or state explosion problem. Bounded model checking (BMC) is a promising analysis method that explores state space within a predefined bound. BMC sacrifices the completeness of traditional model checking but… 

Figures and Tables from this paper

A Method to Analyze High Level Petri Nets using SPIN Model Checker
This paper presents a new transformational analysis method for analyzing a special class of HLPNs – predicate transition (PrT) nets and discusses several properties and shows the detailed model checking results of two properties in one system.
A New Approach for the Symbolic Model Checking of Petri Nets
This study focuses on the adaptation of SAT methods such as BMC and PDR into SMT methods to verify efficiently different properties on nonsafe Petri nets by taking advantage of these nets reductions.


Bounded Model Checking High Level Petri Nets in PIPE+Verifier
This paper presents an analysis method for HLPNs by leveraging the BMC technique with a state-of-the-art satisfiability modulo theories (SMT) solver Z3.
High-Level Petri Net Model Checking with AlPiNA
The Algebraic Petri Nets Analyzer (AlPiNA), a symbolic model checker for High-level Petri nets, is introduced, comprised of two independent modules: a GUI plug-in for Eclipse and an underlying model checking engine.
PIPE+ - A Modeling Tool for High Level Petri Nets
The functionality of PIPE+ is described as well as the process of extending PIPe, which provides helpful insights for others to create Petri net tools suit their own needs are illustrated.
Bounded Model Checking Using Satisfiability Solving
This tutorial focuses on recent techniques that combine model checking with satisfiability solving, known as bounded model checking, which do a very fast exploration of the state space, and for some types of problems seem to offer large performance improvements over previous approaches.
Model Checking
Model checking is applied concurrently with system design, and particularly in its early stages when systems are modelled at a high level of abstraction, because the payoff of finding bugs at that stage is highest whereas the costs are low.
Symbolic Model Checking without BDDs
This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.
Bounded model checking of software using SMT solvers instead of SAT solvers
This paper proposes a generalisation of the cbmc approach on the basis of an encoding into richer (but still decidable) theories than propositional logic, and builds a prototype implementation of the technique that uses a satisfiability modulo theories solver to solve the resulting formulae.
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
Coloured Petri Nets (CPNs) is a language for the modelling and validation of systems in which concurrency, communication, and synchronisation play a major role and CPN Tools is an industrial-strength computer tool for constructing and analysed CPN models.
Checking Safety Properties Using Induction and a SAT-Solver
Some novel induction-based methods are described, and it is shown how they are related to more standard fixpoint algorithms for invariance checking and preliminary experimental results in the verification of FPGA cores are presented.
Z3: An Efficient SMT Solver
Z3 is a new and efficient SMT Solver freely available from Microsoft Research that is used in various software verification and analysis applications.