{"id":"https://openalex.org/W1988925206","doi":"https://doi.org/10.1109/iccd.2012.6378645","title":"A polynomial time flow for implementing free-choice Petri-nets","display_name":"A polynomial time flow for implementing free-choice Petri-nets","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W1988925206","doi":"https://doi.org/10.1109/iccd.2012.6378645","mag":"1988925206"},"language":"en","primary_location":{"id":"doi:10.1109/iccd.2012.6378645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccd.2012.6378645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 30th International Conference on Computer Design (ICCD)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5067917827","display_name":"Pavlos M. Mattheakis","orcid":null},"institutions":[{"id":"https://openalex.org/I142617266","display_name":"University of Crete","ror":"https://ror.org/00dr28g20","country_code":"GR","type":"education","lineage":["https://openalex.org/I142617266"]},{"id":"https://openalex.org/I4210121775","display_name":"FORTH Institute of Computer Science","ror":"https://ror.org/02tf48g55","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210121775","https://openalex.org/I8901234"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Pavlos M. Mattheakis","raw_affiliation_strings":["FORTH-ICS, Crete, Greece","University of Crete, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FORTH-ICS, Crete, Greece","institution_ids":["https://openalex.org/I4210121775"]},{"raw_affiliation_string":"University of Crete, Greece","institution_ids":["https://openalex.org/I142617266"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057269336","display_name":"Christos Sotiriou","orcid":"https://orcid.org/0000-0002-5745-9977"},"institutions":[{"id":"https://openalex.org/I142617266","display_name":"University of Crete","ror":"https://ror.org/00dr28g20","country_code":"GR","type":"education","lineage":["https://openalex.org/I142617266"]},{"id":"https://openalex.org/I4210121775","display_name":"FORTH Institute of Computer Science","ror":"https://ror.org/02tf48g55","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210121775","https://openalex.org/I8901234"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos P. Sotiriou","raw_affiliation_strings":["FORTH-ICS, Crete, Greece","University of Crete, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FORTH-ICS, Crete, Greece","institution_ids":["https://openalex.org/I4210121775"]},{"raw_affiliation_string":"University of Crete, Greece","institution_ids":["https://openalex.org/I142617266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084205024","display_name":"Peter A. Beerel","orcid":"https://orcid.org/0000-0002-8283-0168"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter A. Beerel","raw_affiliation_strings":["Department of Electrical Engineering, University of Southern California, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Southern California, USA","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"e80 d","issue":null,"first_page":"227","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":1.0,"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":1.0,"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.9990000128746033,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.758817195892334},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7446888089179993},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7295653223991394},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5285362601280212},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.49554145336151123},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.48842424154281616},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.48563018441200256},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.4829684793949127},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.46664881706237793},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4550503194332123},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.41564613580703735},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3976265788078308},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35051172971725464},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35040271282196045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15357756614685059}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.758817195892334},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7446888089179993},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7295653223991394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5285362601280212},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.49554145336151123},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.48842424154281616},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.48563018441200256},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.4829684793949127},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.46664881706237793},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4550503194332123},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.41564613580703735},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3976265788078308},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35051172971725464},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35040271282196045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15357756614685059},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccd.2012.6378645","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccd.2012.6378645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 30th International Conference on Computer Design (ICCD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1484092460","https://openalex.org/W1498870363","https://openalex.org/W1543281322","https://openalex.org/W1551214605","https://openalex.org/W1563959012","https://openalex.org/W1625256512","https://openalex.org/W1822320350","https://openalex.org/W1996109622","https://openalex.org/W2014984434","https://openalex.org/W2022537851","https://openalex.org/W2026754366","https://openalex.org/W2063187533","https://openalex.org/W2097267767","https://openalex.org/W2109257065","https://openalex.org/W2122493035","https://openalex.org/W2130434989","https://openalex.org/W2135669900","https://openalex.org/W2136241326","https://openalex.org/W2139135459","https://openalex.org/W2144185673","https://openalex.org/W2160823654","https://openalex.org/W2317462728","https://openalex.org/W2506598342","https://openalex.org/W2520093650","https://openalex.org/W3148038578","https://openalex.org/W6633660204","https://openalex.org/W6638722481","https://openalex.org/W6683394555"],"related_works":["https://openalex.org/W2462966030","https://openalex.org/W874095766","https://openalex.org/W2241400898","https://openalex.org/W2037121848","https://openalex.org/W4312733571","https://openalex.org/W2006962382","https://openalex.org/W2149716943","https://openalex.org/W4315606162","https://openalex.org/W2340807904","https://openalex.org/W1547517160"],"abstract_inverted_index":{"FSM":[0,22,39,133],"and":[1,10,16,66,150,157,174,188,203],"PTnet":[2,58,109,168,184],"control":[3,172],"models":[4,40],"are":[5],"pertinent":[6],"in":[7,27,143,198],"both":[8,14,64,199],"software":[9,28],"hardware":[11],"applications":[12],"as":[13,80],"specification":[15],"implementation":[17,134],"models.":[18,152],"The":[19,56],"state-based,":[20],"monolithic":[21,132],"model":[23,33,59,63],"is":[24,60],"directly":[25],"implementable":[26,128],"or":[29],"hardware,":[30],"but":[31],"cannot":[32],"concurrency":[34,65],"without":[35],"state":[36,87,158,185,200],"explosion.":[37],"Interacting":[38,115,124],"have":[41],"so":[42],"far":[43],"lacked":[44],"the":[45,50,69,85,144,148,179],"formal":[46],"rigor":[47],"for":[48,105,114,183],"expressing":[49],"synchronising":[51],"interactions":[52],"between":[53],"different":[54],"FSMs.":[55],"event-based,":[57],"able":[61],"to":[62,78,178],"choice":[67],"within":[68],"same":[70],"model,":[71,126],"however":[72],"lacks":[73],"a":[74,90,101,107,111,122,140,194],"polynomial":[75,102],"time":[76,156],"flow":[77,104,141,164],"implementation,":[79],"current":[81],"methods":[82],"of":[83,94,161],"exposing":[84],"event":[86,149],"space":[88,159,186,201],"require":[89],"potentially":[91,127],"exponential":[92],"number":[93],"states.":[95],"In":[96],"this":[97],"work,":[98],"we":[99],"present":[100,154],"complexity":[103],"transforming":[106],"Free-Choice":[108],"into":[110],"new":[112],"formalism":[113],"FSMs,":[116],"i.e":[117],"Multiple,":[118],"Synchronised":[119],"FSMs":[120,125],"(MSFSMs),":[121],"compact":[123],"using":[129],"any":[130],"existing":[131],"method.":[135],"We":[136,153],"believe":[137],"that":[138],"such":[139],"can":[142],"long":[145],"term":[146],"bridge":[147],"state-based":[151],"execution":[155,204],"results":[160,177,192],"exercising":[162],"our":[163,176],"on":[165],"25":[166],"large":[167],"specifications,":[169],"describing":[170],"asynchronous":[171],"circuits,":[173],"contrast":[175],"popular":[180],"Petrify":[181],"tool":[182],"exploration":[187],"circuit":[189],"implementation.":[190],"Our":[191],"indicate":[193],"very":[195],"significant":[196],"reduction":[197],"size":[202],"time.":[205]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}