{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T08:44:11Z","timestamp":1762159451502,"version":"build-2065373602"},"reference-count":30,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Quality &amp; Reliability Eng"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Model checking is a formal verification technique used to verify whether a model of a given concurrent software system will meet some special states such as reachability (so\u2010called goal) ones, in the future. Although useful, this heuristic cannot be a suitable way in large models of given systems due to the high time of finding the similarity amount. In this paper, we present a rule\u2010based heuristic that uses the erase\/addition of components by the rules to obtain the interdependence of rules. After acquiring these interdependences, they are employed to explore the state space efficiently. To validate the efficiency of the presented heuristic, it is applied on the concurrent software systems specified through graph transformation language, and implemented in GROOVE, an open\u2010source toolset for designing and model checking graph transformation systems. Experimental results show that the presented heuristic outperforms the existing algorithms in terms of running time, the number of exploration states, and the length of generated witnesses.<\/jats:p>","DOI":"10.1002\/qre.70052","type":"journal-article","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T10:45:22Z","timestamp":1756550722000},"page":"3686-3697","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Innovative Heuristic to Detect Special States in Concurrent Software Systems"],"prefix":"10.1002","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9010-6113","authenticated-orcid":false,"given":"Einollah","family":"Pira","sequence":"first","affiliation":[{"name":"Faculty of Information Technology and Computer Engineering Azarbaijan Shahid Madani University  Tabriz Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1494-3467","authenticated-orcid":false,"given":"Alireza","family":"Rouhi","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology and Computer Engineering Azarbaijan Shahid Madani University  Tabriz Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2025,8,30]]},"reference":[{"key":"e_1_2_11_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2707089"},{"volume-title":"Principles of Model Checking","year":"2008","author":"Baier C.","key":"e_1_2_11_3_1"},{"key":"e_1_2_11_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44577-3_12"},{"key":"e_1_2_11_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61474-5_93"},{"key":"e_1_2_11_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46017-9_10"},{"key":"e_1_2_11_7_1","unstructured":"A.Lluch\u2010Lafuente \u201cSymmetry Reduction and Heuristic Search for Error Detection in Model Checking \u201d in Workshop on Model Checking and Artificial Intelligence (MoChArt\u201003) unpublished manuscript August 10 2003."},{"key":"e_1_2_11_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvlc.2012.12.002"},{"key":"e_1_2_11_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.06.055"},{"key":"e_1_2_11_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2011.22"},{"key":"e_1_2_11_11_1","doi-asserted-by":"crossref","unstructured":"E.AlbaandF.Chicano \u201cFinding Safety Errors with ACO \u201d inProceedings of the 9th Annual Conference on Genetic and Evolutionary Computation 2007 1066\u20131073.","DOI":"10.1145\/1276958.1277171"},{"key":"e_1_2_11_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.04.032"},{"key":"e_1_2_11_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2017.05.128"},{"key":"e_1_2_11_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.06.039"},{"volume-title":"Protocol Verification with Heuristic Search","year":"2001","author":"Edelkamp S.","key":"e_1_2_11_15_1"},{"key":"e_1_2_11_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0095430"},{"key":"e_1_2_11_17_1","unstructured":"S.Ziegert \u201cGraph Transformation Planning Via Abstraction \u201d preprint arXiv July 30 2014 arXiv:1407.7933 https:\/\/doi.org\/10.48550\/arXiv.1407.7933."},{"key":"e_1_2_11_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61723-X_1050"},{"key":"e_1_2_11_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2019.106577"},{"key":"e_1_2_11_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-023-09625-5"},{"key":"e_1_2_11_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-022-06815-4"},{"key":"e_1_2_11_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21887-3_46"},{"key":"e_1_2_11_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39176-7_17"},{"key":"e_1_2_11_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11587-0_4"},{"volume-title":"Learning to Verify Systems","year":"2006","author":"Vardhan A.","key":"e_1_2_11_25_1"},{"key":"e_1_2_11_26_1","first-page":"84","volume-title":"International Workshop on Model Checking and Artificial Intelligence","author":"Araragi T.","year":"2006"},{"key":"e_1_2_11_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/3303"},{"key":"e_1_2_11_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11219-020-09542-x"},{"key":"e_1_2_11_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2018.01.004"},{"key":"e_1_2_11_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-003-0130-9"},{"key":"e_1_2_11_31_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731944"}],"container-title":["Quality and Reliability Engineering International"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/qre.70052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T08:39:04Z","timestamp":1762159144000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/qre.70052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10.1002\/qre.70052"],"URL":"https:\/\/doi.org\/10.1002\/qre.70052","archive":["Portico"],"relation":{},"ISSN":["0748-8017","1099-1638"],"issn-type":[{"type":"print","value":"0748-8017"},{"type":"electronic","value":"1099-1638"}],"subject":[],"published":{"date-parts":[[2025,8,30]]},"assertion":[{"value":"2025-04-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}