Petri nets: an introduction
Theory of linear and integer programming
Theory of linear and integer programming
Free choice Petri nets
GreatSPN 1.7: graphical editor and analyzer for timed and stochastic Petri nets
Performance Evaluation - Special issue: performance modeling tools
Interval diagram techniques for symbolic model checking of Petri nets
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Verification of Safety Properties Using IntegerProgramming: Beyond the State Equation
Formal Methods in System Design
Modelling with Generalized Stochastic Petri Nets
ACM SIGMETRICS Performance Evaluation Review - Special issue on Stochastic Petri Nets
Sharing Trees for "on-the-fly" Verification
Proceedings of the IFIP TC6 Eighth International Conference on Formal Description Techniques VIII
Symbolic Representation of Upward-Closed Sets
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Place or Transition Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Basic Linear Algebraic Techniques for Place or Transition Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Efficient Reachability Set Generation and Storage Using Decision Diagrams
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Structural Methods to Improve the Symbolic Analysis of Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Bounded-memory Algorithms for Verification On-the-fly
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Saving Space by Fully Exploiting Invisible Transitions
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Storage Alternatives for Large Structured State Spaces
Proceedings of the 9th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Analysis of large GSPN models: a distributed solution tool
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
A Generalised Sweep-Line Method for Safety Properties
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
| Hi-index | 0.00 |
We propose a new validation algorithm for bounded Petri Nets. Our method combines state enumeration and structural techniques in order to compute under-approximations of the reachability set and graph of a net. The method is based on two heuristics that exploit properties of T-semiflows to detect acyclic behaviors. T-semiflows also give us an heuristic estimation of the number of levels of the reachability graph we have to keep in memory during forward exploration. This property allows us to organize the space used to store the reachable markings as a circular array, reusing all markings outside a sliding window containing a fixed number of the last levels of the graph. We apply the method to examples taken from the literature [ABC+95,CM97,MCC97]. Our algorithm returns exact results in all the experiments. In some examples, the circular memory allow us to save up to 98% of memory space, and to scale up to 255 the number of tokens in the specification of the initial marking.