{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:35:16Z","timestamp":1740141316929,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2018-161"],"award-info":[{"award-number":["RPG-2018-161"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1109\/tdsc.2022.3227241","type":"journal-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:41:14Z","timestamp":1670445674000},"page":"4474-4485","source":"Crossref","is-referenced-by-count":1,"title":["Solving the Workflow Satisfiability Problem Using General Purpose Solvers"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4030-6525","authenticated-orcid":false,"given":"Daniel","family":"Karapetyan","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Nottingham, Nottingham, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2377-0417","authenticated-orcid":false,"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Royal Holloway, University of London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3381991.3395600"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1063979.1063986"},{"volume-title":"ANSI INCITS 359\u20132004 for Role Based Access Control","year":"2004","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/300830.300837"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3205977.3205982"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3322431.3325418"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.08.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66197-1_13"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2714576.2714633"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_36"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2914642.2914649"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1880022.1880034"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2487222.2487226"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4435"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9877-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11339"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190075"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2988239"},{"key":"ref19","article-title":"A survey on workflow satisfiability, resiliency, and related problems","author":"dos Santos","year":"2017","journal-title":"CoRR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2699497"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"volume-title":"Graph Theory","year":"2012","author":"Diestel","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.11.008"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2752952.2752961"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1727"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"ref27","first-page":"105","article-title":"The SAT phase transition","volume-title":"Proc. 11th Eur. Conf. Artif. Intell.","author":"Gent"},{"article-title":"Phase transition behaviour in constraint satisfaction problems","year":"1997","author":"Grant","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19647-3_13"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/2308930"},{"key":"ref31","article-title":"Solving the workflow satisfiability problem using general purpose solvers","author":"Karapetyan","year":"2022","journal-title":"CoRR"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/10314839\/09973378.pdf?arnumber=9973378","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T05:32:05Z","timestamp":1706765525000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9973378\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":31,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2022.3227241","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"type":"print","value":"1545-5971"},{"type":"electronic","value":"1941-0018"},{"type":"electronic","value":"2160-9209"}],"subject":[],"published":{"date-parts":[[2023,11]]}}}