Arianna Benigno, Roberto Cordone, Luca Ferrarini, Luigi Piroddi
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p3wtlm3j2fedxitkuu4bs3scau" style="color: black;">IFAC Proceedings Volumes</a> </i> &nbsp;
The enumeration of minimal siphons in ordinary Petri nets is fundamental in the assessment of behavioral properties and a crucial step in the development of deadlock prevention algorithms. A novel recursive algorithm is proposed in the paper for this purpose, based on theoretical results that extend well known properties described in the literature. The algorithm uses already found solutions to progressively decompose the search problem into smaller sub-problems. This recursive decomposition
more &raquo; ... roach is combined with the LTUR procedure, which efficiently computes a siphon, based on a logical clause description approach. A prototypical version of the search algorithm has been developed and an experiment has been carried out on a large set of random test instances to evaluate the efficiency of the method.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3182/20050703-6-cz-1902.00293">doi:10.3182/20050703-6-cz-1902.00293</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oxkp77f3tnf5tp6ghjnyrphode">fatcat:oxkp77f3tnf5tp6ghjnyrphode</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830082719/http://folk.ntnu.no/skoge/prost/proceedings/ifac2005/Fullpapers/01919.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/08/08/0808e43de0502e2ee3c3f8d7fcb465579034af4a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3182/20050703-6-cz-1902.00293"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>