{"id":"https://openalex.org/W2938472790","doi":"https://doi.org/10.1109/tvlsi.2008.2012156","title":"Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings","display_name":"Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings","publication_year":2009,"publication_date":"2009-06-25","ids":{"openalex":"https://openalex.org/W2938472790","doi":"https://doi.org/10.1109/tvlsi.2008.2012156","mag":"2938472790"},"language":"en","primary_location":{"id":"doi:10.1109/tvlsi.2008.2012156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2008.2012156","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-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/A5008744860","display_name":"Victor Khomenko","orcid":"https://orcid.org/0000-0001-6422-2006"},"institutions":[{"id":"https://openalex.org/I84884186","display_name":"Newcastle University","ror":"https://ror.org/01kj2bm70","country_code":"GB","type":"education","lineage":["https://openalex.org/I84884186"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Victor Khomenko","raw_affiliation_strings":["School of Computing Science, University of Newcastle, Newcastle-upon-Tyne, UK","School of Computer Science, Newcastle University, Newcastle upon Tyne, UK"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, University of Newcastle, Newcastle-upon-Tyne, UK","institution_ids":["https://openalex.org/I84884186"]},{"raw_affiliation_string":"School of Computer Science, Newcastle University, Newcastle upon Tyne, UK","institution_ids":["https://openalex.org/I84884186"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008744860"],"corresponding_institution_ids":["https://openalex.org/I84884186"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.34129255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"7","first_page":"855","last_page":"868"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7955098152160645},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.7714674472808838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7183682918548584},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6810957193374634},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5197479724884033},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5086687207221985},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.5000817775726318},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.4571627676486969},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4554062783718109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43831369280815125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3472147583961487},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3318655490875244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17805403470993042},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16106930375099182}],"concepts":[{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7955098152160645},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.7714674472808838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7183682918548584},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6810957193374634},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5197479724884033},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5086687207221985},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5000817775726318},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.4571627676486969},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4554062783718109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43831369280815125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3472147583961487},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3318655490875244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17805403470993042},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16106930375099182},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tvlsi.2008.2012156","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2008.2012156","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.7166","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.7166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.newcastle.ac.uk/publications/articles/papers/872.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.63.2402","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.2402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ncl.ac.uk/research/pubs/trs/papers/995.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.5474","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.5474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ncl.ac.uk/research/pubs/inproceedings/papers/977.pdf","raw_type":"text"},{"id":"mag:2938472790","is_oa":false,"landing_page_url":"https://eprints.ncl.ac.uk/160955","pdf_url":null,"source":{"id":"https://openalex.org/S4306529194","display_name":"School of Computing Science Technical Report Series","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"School of Computing Science Technical Report Series","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W87105067","https://openalex.org/W1567452221","https://openalex.org/W1580818410","https://openalex.org/W1996109622","https://openalex.org/W2035560780","https://openalex.org/W2038999728","https://openalex.org/W2102948402","https://openalex.org/W2104835800","https://openalex.org/W2109257065","https://openalex.org/W2111221313","https://openalex.org/W2115252042","https://openalex.org/W2116758077","https://openalex.org/W2127352643","https://openalex.org/W2130434989","https://openalex.org/W2162306903","https://openalex.org/W2164024827","https://openalex.org/W2165997179","https://openalex.org/W2172188813","https://openalex.org/W4230604524","https://openalex.org/W4255548486","https://openalex.org/W6629326351","https://openalex.org/W6674946643","https://openalex.org/W6675085224"],"related_works":["https://openalex.org/W2111221313","https://openalex.org/W2083781943","https://openalex.org/W1549699884","https://openalex.org/W1549521157","https://openalex.org/W3108639822","https://openalex.org/W2396908459","https://openalex.org/W2773629481","https://openalex.org/W2556273741","https://openalex.org/W2131123849","https://openalex.org/W2295129982","https://openalex.org/W2896391630","https://openalex.org/W2054800666","https://openalex.org/W2776844453","https://openalex.org/W2011212908","https://openalex.org/W2921244879","https://openalex.org/W1976695554","https://openalex.org/W2908388437","https://openalex.org/W2145388050","https://openalex.org/W2140021461","https://openalex.org/W1580318981"],"abstract_inverted_index":{"Synthesis":[0],"of":[1,11,17,35,37,53,64,84,95,112,125],"asynchronous":[2],"circuits":[3],"from":[4],"signal":[5],"transition":[6],"graphs":[7],"(STGs)":[8],"involves":[9],"resolution":[10],"state":[12,106],"encoding":[13,56],"conflicts":[14,32],"by":[15,33],"means":[16,34],"refining":[18],"the":[19,62,80,82,93,105,123,126],"STG":[20,81],"specification.":[21],"In":[22],"this":[23],"paper,":[24],"a":[25,71],"fully":[26],"automatic":[27],"technique":[28],"for":[29],"resolving":[30],"such":[31],"insertion":[36],"new":[38,85],"signals":[39,86],"and":[40,66,70,90,114],"concurrency":[41,96],"reduction":[42],"is":[43,46,74],"proposed.":[44],"It":[45],"based":[47,108],"on":[48],"conflict":[49],"cores,":[50],"i.e.,":[51],"sets":[52],"transitions":[54,83],"causing":[55],"conflicts,":[57],"which":[58],"are":[59],"represented":[60],"at":[61],"level":[63],"finite":[65],"complete":[67],"unfolding":[68],"prefixes,":[69],"SAT":[72],"solver":[73],"used":[75],"to":[76,91],"find":[77],"where":[78],"in":[79,110,122],"should":[87],"be":[88],"inserted":[89],"check":[92],"validity":[94],"reductions.":[97],"The":[98],"experimental":[99],"results":[100],"show":[101],"significant":[102],"improvements":[103,121],"over":[104],"space":[107],"approach":[109],"terms":[111],"runtime":[113],"memory":[115],"consumption,":[116],"as":[117,119],"well":[118],"some":[120],"quality":[124],"resulting":[127],"circuits.":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}