Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
Checking properties of nets using transformation
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
The Stubborn Set Method in Practice
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
Net Reductions for LTL Model-Checking
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Adapting Petri Nets Reductions to Promela Specifications
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Decompositional Petri Net Reductions
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Quasar: a new tool for concurrent Ada programs analysis
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Distributed colored Petri net model-checking with CYCLADES
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Automatic symmetry detection in well-formed nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Syntactical colored petri nets reductions
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
On the computation of stubborn sets of colored petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
| Hi-index | 0.00 |
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthelot defined in this thesis some reductions of Petri nets that are based on local structural conditions and that simplify significantly the net. However, the author focused only on the preservation of classical properties (such that liveness, boundedness, ...) that are not necessarily the most useful in practice. In this paper, we prove that two of these structural reductions (the pre and post transitions agglomerations) preserve also a large set of properties expressed in linear-time temporal logics under simple conditions.