Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/14846
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | SERVAIS, Frederic | - |
dc.contributor.author | Reynier, Pierre-Alain | - |
dc.date.accessioned | 2013-03-27T12:00:02Z | - |
dc.date.available | 2013-03-27T12:00:02Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | Fundamenta informaticae, 122 (1-2), p. 1-30 | - |
dc.identifier.issn | 0169-2968 | - |
dc.identifier.uri | http://hdl.handle.net/1942/14846 | - |
dc.description.abstract | This paper presents the Monotone-Pruning algorithm (MP) for computing the minimal coverability set of Petri nets. The original Karp and Miller algorithm (KM) unfolds the reachability graph of a Petri net and uses acceleration on branches to ensure termination. The MP algorithm improves the KM algorithm by adding pruning between branches of the tree. This idea was first introduced in the Minimal Coverability Tree algorithm (MCT), however it was recently shown to be incomplete. The MP algorithm can be viewed as the MCT algorithm with a slightly more aggressive pruning strategy which ensures completeness. Experimental results show that this algorithm is a strong improvement over the KM algorithm as it dramatically reduces the exploration tree. | - |
dc.language.iso | en | - |
dc.rights | COPYRIGHT © 2013 BY POLISH MATHEMATICAL SOCIETY | - |
dc.subject.other | Petri net; concurrency | - |
dc.title | Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 30 | - |
dc.identifier.issue | 1-2 | - |
dc.identifier.spage | 1 | - |
dc.identifier.volume | 122 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | Reprint Address: Reynier, PA (reprint author) - LIF, 163 Ave Luminy,Case 901, F-13288 Marseille 9, France. E-mail Addresses:pierre-alain.reynier@lif.univ-mrs.fr; frederic.servais@uhasselt.be | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
dc.identifier.doi | 10.3233/FI-2013-781 | - |
dc.identifier.isi | 000317266900002 | - |
dc.identifier.url | http://www.mimuw.edu.pl/~fundam/FI/previous/abs122.html | - |
item.accessRights | Open Access | - |
item.contributor | SERVAIS, Frederic | - |
item.contributor | Reynier, Pierre-Alain | - |
item.fullcitation | SERVAIS, Frederic & Reynier, Pierre-Alain (2013) Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. In: Fundamenta informaticae, 122 (1-2), p. 1-30. | - |
item.fulltext | With Fulltext | - |
item.validation | ecoom 2014 | - |
crisitem.journal.issn | 0169-2968 | - |
crisitem.journal.eissn | 1875-8681 | - |
Appears in Collections: | Research publications |
SCOPUSTM
Citations
7
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
8
checked on Sep 28, 2024
Page view(s)
74
checked on Sep 7, 2022
Download(s)
298
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.