{"id":130,"date":"2016-10-07T15:56:46","date_gmt":"2016-10-07T13:56:46","guid":{"rendered":"https:\/\/developpement.lif.univ-mrs.fr\/?p=130"},"modified":"2018-11-15T13:35:12","modified_gmt":"2018-11-15T12:35:12","slug":"mincoverpetri","status":"publish","type":"post","link":"https:\/\/developpement.lis-lab.fr\/?p=130","title":{"rendered":"MinCoverPetri"},"content":{"rendered":"<p>Dans le cadre des recherches de <a href=\"http:\/\/pageperso.lif.univ-mrs.fr\/~pierre-alain.reynier\/\">Pierre-Alain Reynier<\/a> de l&rsquo;\u00e9quipe<a href=\"http:\/\/www.lif.univ-mrs.fr\/recherche\/equipes\/2\/presentation\">\u00a0Mod\u00e9lisation et V\u00e9rification<\/a> (MOVE) ayant abouti \u00e0 la publication <em><a href=\"http:\/\/dx.doi.org\/10.3233\/FI-2013-781\">Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning<\/a><\/em>, un prototype d&rsquo;outil de calcul de l&rsquo;ensemble minimal de couverture de r\u00e9seaux de Petri a \u00e9t\u00e9 d\u00e9velopp\u00e9 en Python.<\/p>\n<p>La cellule d\u00e9veloppement technologique s&rsquo;est appuy\u00e9e sur cette publication et ce prototype pour d\u00e9velopper <a href=\"http:\/\/dev.pages.lis-lab.fr\/mincoverpetri\/\">MinCoverPetri<\/a>, une impl\u00e9mentation optimis\u00e9e de l&rsquo;algorithme de calcul de l&rsquo;ensemble minimal de couverture de r\u00e9seaux de Petri. Cette impl\u00e9mentation est distribu\u00e9e sous licence libre GPLv3+ et son code source est disponible <a href=\"https:\/\/gitlab.lis-lab.fr\/dev\/mincoverpetri\">ici<\/a>.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-131 aligncenter\" src=\"https:\/\/developpement.lif.univ-mrs.fr\/wp-content\/uploads\/2016\/10\/petrinet-300x157.png\" alt=\"petrinet\" width=\"545\" height=\"285\" srcset=\"https:\/\/developpement.lis-lab.fr\/wp-content\/uploads\/2016\/10\/petrinet-300x157.png 300w, https:\/\/developpement.lis-lab.fr\/wp-content\/uploads\/2016\/10\/petrinet.png 599w\" sizes=\"auto, (max-width: 545px) 100vw, 545px\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Dans le cadre des recherches de Pierre-Alain Reynier de l&rsquo;\u00e9quipe\u00a0Mod\u00e9lisation et V\u00e9rification (MOVE) ayant abouti \u00e0 la publication Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning, un prototype d&rsquo;outil de calcul de l&rsquo;ensemble minimal de couverture de r\u00e9seaux de Petri a \u00e9t\u00e9 d\u00e9velopp\u00e9 en Python. La cellule d\u00e9veloppement technologique s&rsquo;est appuy\u00e9e\u2026 <span class=\"read-more\"><a href=\"https:\/\/developpement.lis-lab.fr\/?p=130\">Lire la suite &raquo;<\/a><\/span><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[9],"tags":[12,21],"class_list":["post-130","post","type-post","status-publish","format-standard","hentry","category-projets-passes","tag-c","tag-petri"],"_links":{"self":[{"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/posts\/130","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=130"}],"version-history":[{"count":15,"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/posts\/130\/revisions"}],"predecessor-version":[{"id":206,"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=\/wp\/v2\/posts\/130\/revisions\/206"}],"wp:attachment":[{"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=130"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=130"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/developpement.lis-lab.fr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=130"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}