{"id":"https://openalex.org/W2092562609","doi":"https://doi.org/10.1109/coase.2013.6654014","title":"Compositional nonblocking verification for extended finite-state automata using partial unfolding","display_name":"Compositional nonblocking verification for extended finite-state automata using partial unfolding","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2092562609","doi":"https://doi.org/10.1109/coase.2013.6654014","mag":"2092562609"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2013.6654014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2013.6654014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","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/A5056156627","display_name":"Sahar Mohajerani","orcid":"https://orcid.org/0000-0002-9933-8946"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Sahar Mohajerani","raw_affiliation_strings":["Department of Signals and Systems, Chalmers University of Technology, G\u00f6teborg, Sweden","Dept. of Signals and Systems, Chalmers Univ. of Technology, G\u00f6teborg, Sweden#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Dept. of Signals and Systems, Chalmers Univ. of Technology, G\u00f6teborg, Sweden#TAB#","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009427975","display_name":"Robi Malik","orcid":"https://orcid.org/0000-0002-6118-8129"},"institutions":[{"id":"https://openalex.org/I52179390","display_name":"University of Waikato","ror":"https://ror.org/013fsnh78","country_code":"NZ","type":"education","lineage":["https://openalex.org/I52179390"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Robi Malik","raw_affiliation_strings":["Department of Computer Science, The University of Waikato, Hamilton, New Zealand","Department of Computer Science, University of Waikato, Hamilton, New zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Waikato, Hamilton, New Zealand","institution_ids":["https://openalex.org/I52179390"]},{"raw_affiliation_string":"Department of Computer Science, University of Waikato, Hamilton, New zealand","institution_ids":["https://openalex.org/I52179390"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017972835","display_name":"Martin Fabian","orcid":"https://orcid.org/0000-0003-1287-9748"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Martin Fabian","raw_affiliation_strings":["Department of Signals and Systems, Chalmers University of Technology, G\u00f6teborg, Sweden","Dept. of Signals and Systems, Chalmers Univ. of Technology, G\u00f6teborg, Sweden#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Signals and Systems, Chalmers University of Technology, G\u00f6teborg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"Dept. of Signals and Systems, Chalmers Univ. of Technology, G\u00f6teborg, Sweden#TAB#","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056156627"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":1.851,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.86054454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"930","last_page":"935"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9997000098228455,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/automaton","display_name":"Automaton","score":0.7490043640136719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7392921447753906},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6122016906738281},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6050912141799927},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5674696564674377},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.521946132183075},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5204577445983887},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5052099823951721},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.46949103474617004},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4599307179450989},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.43192020058631897},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40725329518318176},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32917922735214233},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19170942902565002},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.18484839797019958}],"concepts":[{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7490043640136719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7392921447753906},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6122016906738281},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6050912141799927},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5674696564674377},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.521946132183075},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5204577445983887},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5052099823951721},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.46949103474617004},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4599307179450989},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.43192020058631897},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40725329518318176},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32917922735214233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19170942902565002},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.18484839797019958},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/coase.2013.6654014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2013.6654014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},{"id":"pmh:oai:publications.lib.chalmers.se:188583","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/188583-compositional-nonblocking-verification-for-extended-finite-state-automata-using-partial-unfolding","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:188583","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/188583","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W180415872","https://openalex.org/W258022877","https://openalex.org/W1548644447","https://openalex.org/W1964031948","https://openalex.org/W1997749897","https://openalex.org/W2016140364","https://openalex.org/W2016890988","https://openalex.org/W2059057465","https://openalex.org/W2081177528","https://openalex.org/W2096469944","https://openalex.org/W2107308368","https://openalex.org/W2110924437","https://openalex.org/W2116828026","https://openalex.org/W2140197499","https://openalex.org/W2160146978","https://openalex.org/W2167978186","https://openalex.org/W2589217375","https://openalex.org/W2913663755","https://openalex.org/W4300021588","https://openalex.org/W6607257137","https://openalex.org/W6649628602","https://openalex.org/W6654587760"],"related_works":["https://openalex.org/W2746280673","https://openalex.org/W2152996796","https://openalex.org/W1594593035","https://openalex.org/W127357700","https://openalex.org/W1483156373","https://openalex.org/W1572578464","https://openalex.org/W1480528870","https://openalex.org/W2508541108","https://openalex.org/W2560415449","https://openalex.org/W2315419748"],"abstract_inverted_index":{"This":[0],"paper":[1,101],"describes":[2],"a":[3,81],"framework":[4],"for":[5,96],"compositional":[6,110],"nonblocking":[7,31],"verification":[8,19,86,111],"of":[9,33,109],"discrete":[10,35],"event":[11,36],"systems":[12],"modelled":[13],"as":[14,64,91],"extended":[15,44],"finite-state":[16,45],"automata.":[17],"Compositional":[18],"is":[20,58,72,88],"shown":[21],"in":[22,79],"previous":[23],"work":[24],"to":[25,28,43,55,74,112],"be":[26,56],"efficient":[27],"verify":[29],"the":[30,76,84,89,97,107],"property":[32],"large":[34],"systems.":[37],"Here,":[38],"these":[39],"results":[40],"are":[41],"applied":[42],"automata":[46],"communicating":[47],"via":[48],"shared":[49],"variables":[50,63],"and":[51],"events.":[52],"The":[53,100],"model":[54],"verified":[57],"composed":[59],"gradually,":[60],"partially":[61],"unfolding":[62],"needed.":[65],"At":[66],"each":[67],"step,":[68],"symbolic":[69],"observation":[70],"equivalence":[71],"used":[73],"simplify":[75],"resultant":[77],"components":[78],"such":[80],"way":[82],"that":[83],"final":[85],"result":[87],"same":[90],"it":[92],"would":[93],"have":[94],"been":[95],"original":[98],"model.":[99],"concludes":[102],"with":[103],"an":[104],"example":[105],"showing":[106],"potential":[108],"achieve":[113],"substantial":[114],"state-space":[115],"reduction.":[116]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}