{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:42:38Z","timestamp":1740134558859,"version":"3.37.3"},"reference-count":23,"publisher":"Wiley","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["DUT14QY05","1600-851025"],"award-info":[{"award-number":["DUT14QY05","1600-851025"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["DUT14QY05","1600-851025"],"award-info":[{"award-number":["DUT14QY05","1600-851025"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>Nonclassical slicing and symmetry reduction can act as efficient structural abstract methods for pruning state space when dealing with verification problems. In this paper, we mainly address theoretical and algorithmic aspects for nonclassical slicing and symmetry reduction over prime event structures. We propose sliced and symmetric quotient reduction models of event structures and present their corresponding algorithms. To construct the underlying foundation of the proposed methodologies, we introduce strong and weak conflict concepts and a pair of mutually inverse operators and extend permutation group based symmetry notion of event structures. We have established a unified mathematical framework for slicing and symmetry reduction, and further investigated the translation, isomorphism, and equivalence relationship and other related basic facts from a theoretical point of view. The framework may provide useful guidance and theoretical exploration for overcoming verification challenges. This paper also demonstrates their practical applications by two cases.<\/jats:p>","DOI":"10.1155\/2014\/352152","type":"journal-article","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T22:24:40Z","timestamp":1402611880000},"page":"1-20","source":"Crossref","is-referenced-by-count":0,"title":["Unified Mathematical Framework for Slicing and Symmetry Reduction over Event Structures"],"prefix":"10.1155","volume":"2014","author":[{"given":"Xinyan","family":"Gao","sequence":"first","affiliation":[{"name":"G&S Labs, School of Software, Dalian University of Technology, Dalian 116620, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingcai","family":"Ding","sequence":"additional","affiliation":[{"name":"G&S Labs, School of Software, Dalian University of Technology, Dalian 116620, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbo","family":"Liu","sequence":"additional","affiliation":[{"name":"G&S Labs, School of Software, Dalian University of Technology, Dalian 116620, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaidi","family":"Zheng","sequence":"additional","affiliation":[{"name":"G&S Labs, School of Software, Dalian University of Technology, Dalian 116620, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyu","family":"Huang","sequence":"additional","affiliation":[{"name":"G&S Labs, School of Software, Dalian University of Technology, Dalian 116620, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7466-8925","authenticated-orcid":true,"given":"Ning","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China"},{"name":"School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dakui","family":"Li","sequence":"additional","affiliation":[{"name":"G&S Labs, School of Software, Dalian University of Technology, Dalian 116620, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/32.940566"},{"key":"20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00625969","volume":"9","year":"1996","journal-title":"Formal Methods in System Design"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02973443"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/358557.358577"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1011"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013019"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17906-2_31"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52048-1_40"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90112-2"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90112-2"},{"issue":"1","key":"31","doi-asserted-by":"crossref","first-page":"39","DOI":"10.3233\/FI-1991-14103","volume":"14","year":"1991","journal-title":"Fundamenta Informaticae"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56922-7_38"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1132960.1132962"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.022"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013026"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013026"},{"key":"26","first-page":"1","volume-title":"Models for concurrency","volume":"4","year":"1995"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.03.005"},{"issue":"2","key":"21","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","year":"1986","journal-title":"ACM Transactions on Programming Languages and Systems"},{"first-page":"viii+248","year":"1990","series-title":"Cambridge Mathematical Textbooks","key":"9"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53479-2_4"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00310-6"},{"first-page":"331","volume-title":"Bundle event structures: a non-interleaving semantics for LOTOS","year":"1992","key":"34"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2014\/352152.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2014\/352152.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2014\/352152.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,7]],"date-time":"2022-04-07T23:21:25Z","timestamp":1649373685000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jam\/2014\/352152\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":23,"alternative-id":["352152","352152"],"URL":"https:\/\/doi.org\/10.1155\/2014\/352152","relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2014]]}}}