{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:42:42Z","timestamp":1740134562210,"version":"3.37.3"},"reference-count":24,"publisher":"Wiley","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"],"award-info":[{"award-number":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"],"award-info":[{"award-number":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"],"award-info":[{"award-number":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National High-Tech Development Program of China","award":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"],"award-info":[{"award-number":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"]}]},{"name":"China Mobile Research Foundation","award":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"],"award-info":[{"award-number":["90718010","61003099","2009CB320700","2012AA040904","MCM20123011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>Business process models are required to be in line with frequently changing regulations, policies, and environments. In the field of intelligent modeling, organisations concern automated business process compliance checking as the manual verification is a time-consuming and inefficient work. There exist two key issues for business process compliance checking. One is the definition of a business process retrieval language that can be employed to capture the compliance rules, the other concerns efficient evaluation of these rules. Traditional syntax-based retrieval approaches cannot deal with various important requirements of compliance checking in practice. Although a retrieval language that is based on semantics can overcome the drawback of syntax-based ones, it suffers from the well-known state space explosion. In this paper, we define a semantics-based process model query language through simplifying a property specification pattern system without affecting its expressiveness. We use this language to capture semantics-based compliance rules and constraints. We also propose a feasible approach in such a way that the compliance checking will not suffer from the state space explosion as much as possible. A tool is implemented to evaluate the efficiency. An experiment conducted on three model collections illustrates that our technology is very efficient.<\/jats:p>","DOI":"10.1155\/2013\/962765","type":"journal-article","created":{"date-parts":[[2013,6,19]],"date-time":"2013-06-19T21:04:28Z","timestamp":1371675868000},"page":"1-24","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding"],"prefix":"10.1155","volume":"2013","author":[{"given":"Liang","family":"Song","sequence":"first","affiliation":[{"name":"School of Software, Tsinghua University, Beijing 100084, China"},{"name":"Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China"},{"name":"Key Lab for Information System Security, Ministry of Education, Beijing 100084, China"},{"name":"National Laboratory for Information Science and Technology, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianmin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software, Tsinghua University, Beijing 100084, China"},{"name":"Key Lab for Information System Security, Ministry of Education, Beijing 100084, China"},{"name":"National Laboratory for Information Science and Technology, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijie","family":"Wen","sequence":"additional","affiliation":[{"name":"School of Software, Tsinghua University, Beijing 100084, China"},{"name":"Key Lab for Information System Security, Ministry of Education, Beijing 100084, China"},{"name":"National Laboratory for Information Science and Technology, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6658-4235","authenticated-orcid":true,"given":"Hui","family":"Kong","sequence":"additional","affiliation":[{"name":"School of Software, Tsinghua University, Beijing 100084, China"},{"name":"Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.02.005"},{"first-page":"326","volume-title":"Efficient compliance checking using BPMN-Q and temporal logic","series-title":"Lecture Notes in Computer Science","key":"3"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01384314"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014746130920"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022474"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01463946"},{"issue":"1","key":"11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","year":"1998","journal-title":"Journal of Circuits, Systems and Computers"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2008.02.006"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.03.002"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(99)00016-6"},{"first-page":"429","volume-title":"The state explosion problem","year":"1996","key":"17"},{"key":"18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/978-3-642-16934-2_28","volume-title":"Efficient and accurate retrieval of business process models through indexing (short paper)","volume":"6426","year":"2010"},{"year":"1998","key":"19"},{"key":"20","series-title":"Lecture Notes in Computer Science","volume-title":"Instantaneous soundness checking of industrial business process models","volume":"5701","year":"2009"},{"key":"21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"An improvement of McMillan\u2019s unfolding algorithm","volume":"1055","year":"1996"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2012.06.002"},{"key":"27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/11841760_34","volume-title":"Repository for business processes and arbitrary associated metadata","volume":"4102","year":"2006"},{"key":"28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11841760_1","volume-title":"ProcessGene Query\u2014a tool for querying the content layer of business process models","volume":"4102","year":"2006"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2004.08.011"},{"key":"32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/11841760_34","volume-title":"Managing process variants as an information resource","volume":"4102","year":"2006"},{"key":"35","series-title":"CRPIT","first-page":"71","volume-title":"Measuring similarity between semantic business process models","year":"2007"},{"key":"36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/978-3-540-69534-9_34","volume-title":"Measuring similarity between business process models","volume":"5074","year":"2008"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.96"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/962765.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/962765.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/962765.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T17:07:11Z","timestamp":1588957631000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jam\/2013\/962765\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":24,"alternative-id":["962765","962765"],"URL":"https:\/\/doi.org\/10.1155\/2013\/962765","relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2013]]}}}