{"id":"https://openalex.org/W2160063844","doi":"https://doi.org/10.1109/cmpsac.2002.1045086","title":"Toward efficient algorithms for generating compact Petri nets from labeled transition systems","display_name":"Toward efficient algorithms for generating compact Petri nets from labeled transition systems","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2160063844","doi":"https://doi.org/10.1109/cmpsac.2002.1045086","mag":"2160063844"},"language":"en","primary_location":{"id":"doi:10.1109/cmpsac.2002.1045086","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cmpsac.2002.1045086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 26th Annual International Computer Software and Applications","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/A5045974765","display_name":"Ugo Buy","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"U. Buy","raw_affiliation_strings":["Computer Science Department, University of Illinois, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Illinois, Chicago, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026548525","display_name":"G. Singal","orcid":null},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Singal","raw_affiliation_strings":["Computer Science Department, University of Illinois, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Illinois, Chicago, USA","institution_ids":["https://openalex.org/I39422238"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045974765"],"corresponding_institution_ids":["https://openalex.org/I39422238"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.21816143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":null,"first_page":"717","last_page":"722"},"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.9994000196456909,"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.9976999759674072,"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/petri-net","display_name":"Petri net","score":0.9712541103363037},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9577218294143677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7543073296546936},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.7278695106506348},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6182176470756531},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.5640506148338318},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5576655864715576},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.531832754611969},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48930713534355164},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4795122444629669},{"id":"https://openalex.org/keywords/process-architecture","display_name":"Process architecture","score":0.4778285026550293},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4451853632926941},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4165314733982086},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3387118875980377},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.32954996824264526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18928492069244385},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09870323538780212}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.9712541103363037},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9577218294143677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7543073296546936},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.7278695106506348},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6182176470756531},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.5640506148338318},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5576655864715576},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.531832754611969},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48930713534355164},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4795122444629669},{"id":"https://openalex.org/C136155141","wikidata":"https://www.wikidata.org/wiki/Q7247260","display_name":"Process architecture","level":3,"score":0.4778285026550293},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4451853632926941},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4165314733982086},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3387118875980377},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32954996824264526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18928492069244385},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09870323538780212},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cmpsac.2002.1045086","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cmpsac.2002.1045086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 26th Annual International Computer Software and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W258022877","https://openalex.org/W1503973138","https://openalex.org/W1534926211","https://openalex.org/W1589276513","https://openalex.org/W1802674666","https://openalex.org/W1833736042","https://openalex.org/W1934074768","https://openalex.org/W1986332631","https://openalex.org/W2032838513","https://openalex.org/W2048775824","https://openalex.org/W2095603938","https://openalex.org/W2143997593","https://openalex.org/W2157597221","https://openalex.org/W2158163902","https://openalex.org/W3023118559","https://openalex.org/W4246017475","https://openalex.org/W6631902900","https://openalex.org/W6638428988","https://openalex.org/W6777076932"],"related_works":["https://openalex.org/W1543378523","https://openalex.org/W1980200158","https://openalex.org/W2154794415","https://openalex.org/W2107824370","https://openalex.org/W2522627362","https://openalex.org/W2020720940","https://openalex.org/W1531156418","https://openalex.org/W2148229336","https://openalex.org/W2133661350","https://openalex.org/W4255837018"],"abstract_inverted_index":{"Compositional":[0],"methods":[1],"for":[2,57,116],"Petri-net-based":[3],"verification":[4],"of":[5,15,36,51,63,67,74,92,109,124,135,145],"concurrent":[6],"systems":[7],"are":[8],"appealing":[9],"because":[10],"they":[11],"allow":[12],"the":[13,34,48,52,61,68,72,75,90,101,107,118,136,143,146],"analysis":[14,32],"a":[16,24,37,41,65,93,125],"complex":[17,134],"system":[18,44],"to":[19,47,81,100],"be":[20,82],"carried":[21],"out":[22],"in":[23,29,77,142],"piece-by-piece":[25],"manner.":[26],"An":[27],"issue":[28],"compositional":[30],"Petri-net":[31,58],"is":[33,139],"generation":[35,59,91],"compact":[38],"net":[39,95],"from":[40,96],"labeled":[42],"transition":[43],"(LTS)":[45],"isomorphic":[46,99],"reachability":[49,103],"graph":[50,104],"net.":[53,131],"Several":[54],"existing":[55],"approaches":[56],"use":[60],"concept":[62],"region,":[64],"subset":[66],"original":[69],"LTS;":[70],"however,":[71],"computation":[73,108],"regions":[76],"an":[78,97],"LTS":[79,98],"appears":[80],"quite":[83],"expensive.":[84],"We":[85,111],"report":[86],"preliminary":[87],"results":[88],"on":[89],"Petri":[94,130],"net's":[102],"without":[105],"requiring":[106],"regions.":[110],"specifically":[112],"introduce":[113],"two":[114,137],"algorithms":[115,138],"generating":[117],"place":[119],"set":[120],"and":[121,127],"flow":[122],"relation":[123],"safe":[126],"live":[128],"ordinary":[129],"The":[132],"most":[133],"nearly":[140],"linear":[141],"size":[144],"input":[147],"LTS.":[148]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}