A unified approach for deciding the existence of certain Petri net paths
Information and Computation
Proving temporal properties of Petri Nets
Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
On the Decidability of Model Checking for Several µ-calculi and Petri Nets
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Incremental construction of coverability graphs
Information Processing Letters
A temporal graph logic for verification of graph transformation systems
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
| Hi-index | 0.00 |
We show that several formulas of a temporal logic can beverified using the coverability graph of the underlying system. Ofcourse, the procedure is not capable of verifying all formulae, sincealready the reachability problem for (unbounded) Petri nets iscomputationally hard. Thus, the procedure returns true, false, orunknown for a query. The formulae that can be verified cover most ofthe well known standard properties which have been listed in thecontext of coverability graph analysis so far.