{"id":"https://openalex.org/W4376852408","doi":"https://doi.org/10.1145/3573942.3574016","title":"A Bounded Model Checking Method for Concurrent Systems in xUML4MC","display_name":"A Bounded Model Checking Method for Concurrent Systems in xUML4MC","publication_year":2022,"publication_date":"2022-09-23","ids":{"openalex":"https://openalex.org/W4376852408","doi":"https://doi.org/10.1145/3573942.3574016"},"language":"en","primary_location":{"id":"doi:10.1145/3573942.3574016","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3573942.3574016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 5th International Conference on Artificial Intelligence and Pattern Recognition","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/A5029605914","display_name":"Xinfeng Shu","orcid":"https://orcid.org/0000-0002-7293-4510"},"institutions":[{"id":"https://openalex.org/I4210136859","display_name":"Xi\u2019an University of Posts and Telecommunications","ror":"https://ror.org/04jn0td46","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210136859"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xinfeng Shu","raw_affiliation_strings":["School of Computer Science and Technology, Xi'an University of Posts and Telecommunications, China"],"raw_orcid":"https://orcid.org/0000-0002-7293-4510","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xi'an University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I4210136859"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064269043","display_name":"Zewei Yang","orcid":"https://orcid.org/0000-0002-7280-0504"},"institutions":[{"id":"https://openalex.org/I4210136859","display_name":"Xi\u2019an University of Posts and Telecommunications","ror":"https://ror.org/04jn0td46","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210136859"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zewei Yang","raw_affiliation_strings":["School of Computer Science and Technology, Xi'an University of Posts and Telecommunications, China"],"raw_orcid":"https://orcid.org/0000-0002-7280-0504","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Xi'an University of Posts and Telecommunications, China","institution_ids":["https://openalex.org/I4210136859"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029605914"],"corresponding_institution_ids":["https://openalex.org/I4210136859"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20049428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"236","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9991000294685364,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/model-checking","display_name":"Model checking","score":0.8120579719543457},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7788175344467163},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6265466809272766},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.562900722026825},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4941389858722687},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.49091678857803345},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.48236602544784546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.463454931974411},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.46270182728767395},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4359247386455536},{"id":"https://openalex.org/keywords/two-way-deterministic-finite-automaton","display_name":"Two-way deterministic finite automaton","score":0.4348280429840088},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4342443346977234},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.39764347672462463},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3633289337158203},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2252952754497528},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.14470574259757996},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1377067267894745},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09431564807891846}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8120579719543457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7788175344467163},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6265466809272766},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.562900722026825},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4941389858722687},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.49091678857803345},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.48236602544784546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.463454931974411},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.46270182728767395},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4359247386455536},{"id":"https://openalex.org/C139423837","wikidata":"https://www.wikidata.org/wiki/Q243800","display_name":"Two-way deterministic finite automaton","level":5,"score":0.4348280429840088},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4342443346977234},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.39764347672462463},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3633289337158203},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2252952754497528},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.14470574259757996},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1377067267894745},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09431564807891846},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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.1145/3573942.3574016","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3573942.3574016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 5th International Conference on Artificial Intelligence and Pattern Recognition","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W106387794","https://openalex.org/W147489498","https://openalex.org/W2037296871","https://openalex.org/W2912640545","https://openalex.org/W4205412112","https://openalex.org/W6684644128"],"related_works":["https://openalex.org/W2026879508","https://openalex.org/W2155870982","https://openalex.org/W186350370","https://openalex.org/W2321527407","https://openalex.org/W2522171317","https://openalex.org/W2042728676","https://openalex.org/W1482505495","https://openalex.org/W2408583837","https://openalex.org/W3135656023","https://openalex.org/W3082406058"],"abstract_inverted_index":{"In":[0],"response":[1],"to":[2,35,83,99],"the":[3,10,44,56,64,84,96,104,110,121],"problem":[4],"that":[5,120],"software":[6],"testing":[7],"cannot":[8],"satisfy":[9],"verification":[11,28],"of":[12],"multi-threaded":[13],"programs,":[14],"a":[15,71,91,114],"visual":[16,45],"modeling":[17],"language":[18],"(Extending":[19],"UML":[20],"for":[21],"Model":[22],"Checking,":[23],"xUML4MC)":[24],"oriented":[25],"concurrent":[26,33,46,57,131],"program":[27,34,52],"method":[29],"is":[30,38,49,60,68],"proposed.":[31],"The":[32],"be":[36,100],"verified":[37],"visually":[39],"modeled":[40],"by":[41],"xUML4MC;":[42],"firstly,":[43],"system":[47,58,66,80,107],"model":[48,59,67,115,123],"analyzed":[50],"using":[51,90,113],"analysis":[53],"techniques,":[54],"and":[55,62,102,109,133],"sequenced,":[61],"then":[63],"sequenced":[65],"transformed":[69],"into":[70],"Lightweight":[72],"Concurrent":[73],"Transition":[74],"System(LCTS);Then,":[75],"we":[76],"construct":[77],"an":[78],"impoverished":[79,106],"automaton":[81,108],"corresponding":[82],"LCTS,":[85],"simplify":[86],"its":[87],"state":[88],"space":[89],"partial-order":[92],"statute":[93],"algorithm,":[94],"extract":[95],"nature":[97,111],"non-automaton":[98,112],"verified,":[101],"verify":[103],"simplified":[105],"checking":[116,124],"technique.":[117],"Experiments":[118],"show":[119],"developed":[122],"tool":[125],"can":[126],"successfully":[127],"detect":[128],"errors":[129],"in":[130],"programs":[132],"give":[134],"counterexample":[135],"paths.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}