Skip to Main content Skip to Navigation
Conference papers

Petri Net Reductions for Counting Markings

Bernard Berthomieu 1 Didier Le Botlan 1, * Silvano Dal Zilio 1
* Corresponding author
1 LAAS-VERTICS - Équipe Verification de Systèmes Temporisés Critiques
LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : We propose a method to count the number of reachable markings of a Petri net without having to enumerate these rst. The method relies on a structural reduction system that reduces the number of places and transitions of the net in such a way that we can faithfully compute the number of reachable markings of the original net from the reduced net and the reduction history. The method has been implemented and computing experiments show that reductions are eective on a large benchmark of models.
Complete list of metadata

https://hal.laas.fr/hal-01822078
Contributor : Silvano Dal Zilio <>
Submitted on : Wednesday, June 27, 2018 - 3:26:38 PM
Last modification on : Thursday, June 10, 2021 - 3:01:43 AM
Long-term archiving on: : Wednesday, September 26, 2018 - 8:05:11 PM

Files

spin.pdf
Files produced by the author(s)

Identifiers

Citation

Bernard Berthomieu, Didier Le Botlan, Silvano Dal Zilio. Petri Net Reductions for Counting Markings. International Symposium on Model Checking Software (SPIN 2018), Jun 2018, Malaga, Spain. ⟨10.1007/978-3-319-94111-0_4⟩. ⟨hal-01822078⟩

Share

Metrics

Record views

195

Files downloads

210