{"id":"https://openalex.org/W2152222955","doi":"https://doi.org/10.1109/icsmc.2004.1399939","title":"Efficient reachability analysis of bounded petri nets using constraint programming","display_name":"Efficient reachability analysis of bounded petri nets using constraint programming","publication_year":2005,"publication_date":"2005-03-31","ids":{"openalex":"https://openalex.org/W2152222955","doi":"https://doi.org/10.1109/icsmc.2004.1399939","mag":"2152222955"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2004.1399939","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2004.1399939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110886333","display_name":"Thomas Bourdeaud\u2019huy","orcid":null},"institutions":[{"id":"https://openalex.org/I7454413","display_name":"\u00c9cole Centrale de Lille","ror":"https://ror.org/01x441g73","country_code":"FR","type":"education","lineage":["https://openalex.org/I7454413"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"T. Bourdeaud'huy","raw_affiliation_strings":["Ecole Centrale de Lille, L.A.G.I.S., Villeneuve d' Ascq, FRANCE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Centrale de Lille, L.A.G.I.S., Villeneuve d' Ascq, FRANCE","institution_ids":["https://openalex.org/I7454413"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084886504","display_name":"Pascal Yim","orcid":"https://orcid.org/0000-0001-9315-7928"},"institutions":[{"id":"https://openalex.org/I7454413","display_name":"\u00c9cole Centrale de Lille","ror":"https://ror.org/01x441g73","country_code":"FR","type":"education","lineage":["https://openalex.org/I7454413"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"P. Yim","raw_affiliation_strings":["Ecole Centrale de Lille, L.A.G.I.S., Villeneuve d' Ascq, FRANCE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Centrale de Lille, L.A.G.I.S., Villeneuve d' Ascq, FRANCE","institution_ids":["https://openalex.org/I7454413"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110016513","display_name":"S. Hanafi","orcid":null},"institutions":[{"id":"https://openalex.org/I70348806","display_name":"Universit\u00e9 Polytechnique Hauts-de-France","ror":"https://ror.org/02ezch769","country_code":"FR","type":"education","lineage":["https://openalex.org/I70348806"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S. Hanafi","raw_affiliation_strings":["L.A.M.LH., Universit\u00e9 de Valenciennes, Valenciennes, FRANCE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"L.A.M.LH., Universit\u00e9 de Valenciennes, Valenciennes, FRANCE","institution_ids":["https://openalex.org/I70348806"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3303,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.82506234,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"2","issue":null,"first_page":"1870","last_page":"1875"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10703","display_name":"Business Process Modeling and Analysis","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9762789607048035},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.953886866569519},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7441546320915222},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.620612621307373},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.5911171436309814},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5485251545906067},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5413837432861328},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5182878375053406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49285078048706055},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.48018136620521545},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38877689838409424},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3336266279220581},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3117877244949341}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9762789607048035},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.953886866569519},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7441546320915222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.620612621307373},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.5911171436309814},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5485251545906067},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5413837432861328},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5182878375053406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49285078048706055},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.48018136620521545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38877689838409424},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3336266279220581},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3117877244949341},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2004.1399939","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2004.1399939","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1844032500","https://openalex.org/W1983788549","https://openalex.org/W1994350081","https://openalex.org/W1996109622","https://openalex.org/W2001817854","https://openalex.org/W2016300863","https://openalex.org/W2126479399","https://openalex.org/W2135648070","https://openalex.org/W2175982508","https://openalex.org/W2179661259","https://openalex.org/W2561237459","https://openalex.org/W2670534786","https://openalex.org/W6646400605","https://openalex.org/W6685456839","https://openalex.org/W6685631781"],"related_works":["https://openalex.org/W1980200158","https://openalex.org/W2154794415","https://openalex.org/W2107824370","https://openalex.org/W2110957508","https://openalex.org/W2522627362","https://openalex.org/W2353505923","https://openalex.org/W2387511021","https://openalex.org/W2400441765","https://openalex.org/W2095453628","https://openalex.org/W1531156418"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,32],"consider":[4],"the":[5,40,53,61,75],"Petri":[6,28],"net":[7],"(PNs)":[8],"reachability":[9,76],"problem,":[10],"which":[11,31,58],"consists":[12],"of":[13,64,74],"finding":[14],"transition":[15],"firing":[16],"sequences":[17],"leading":[18],"to":[19,60,66,70],"a":[20,34],"given":[21],"target":[22],"marking.":[23],"We":[24,49],"focus":[25],"on":[26],"bounded":[27],"nets":[29],"for":[30,51],"develop":[33],"correct":[35],"and":[36,47],"complete":[37],"algorithm":[38],"using":[39],"logical":[41],"abstraction":[42],"technique":[43],"proposed":[44],"by":[45],"Benasser":[46],"Yim.":[48],"define":[50],"that":[52],"PN":[54],"sequential":[55],"depth":[56],"parameter,":[57],"corresponds":[59],"maximal":[62],"number":[63],"transitions":[65],"fire":[67],"in":[68],"order":[69],"reach":[71],"any":[72],"marking":[73],"graph.":[77]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}