{"id":"https://openalex.org/W2052773530","doi":"https://doi.org/10.1145/2487222.2487226","title":"On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem","display_name":"On the Parameterized Complexity and Kernelization of the Workflow Satisfiability Problem","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2052773530","doi":"https://doi.org/10.1145/2487222.2487226","mag":"2052773530"},"language":"en","primary_location":{"id":"doi:10.1145/2487222.2487226","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2487222.2487226","pdf_url":null,"source":{"id":"https://openalex.org/S2642811","display_name":"ACM Transactions on Information and System Security","issn_l":"1094-9224","issn":["1094-9224","1557-7406"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Information and System Security","raw_type":"journal-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/A5109050799","display_name":"Jason Crampton","orcid":"https://orcid.org/0000-0003-2151-8426"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jason Crampton","raw_affiliation_strings":["Royal Holloway, University of London"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044021493","display_name":"Gregory Gutin","orcid":"https://orcid.org/0000-0002-2377-0417"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gregory Gutin","raw_affiliation_strings":["Royal Holloway, University of London"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012051081","display_name":"Anders Yeo","orcid":"https://orcid.org/0000-0003-0293-8708"},"institutions":[{"id":"https://openalex.org/I24027795","display_name":"University of Johannesburg","ror":"https://ror.org/04z6c2n17","country_code":"ZA","type":"education","lineage":["https://openalex.org/I24027795"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Anders Yeo","raw_affiliation_strings":["University of Johannesburg"],"affiliations":[{"raw_affiliation_string":"University of Johannesburg","institution_ids":["https://openalex.org/I24027795"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109050799"],"corresponding_institution_ids":["https://openalex.org/I184558857"],"apc_list":null,"apc_paid":null,"fwci":35.5619,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.99665759,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"16","issue":"1","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7928673624992371},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7804999351501465},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.7265775799751282},{"id":"https://openalex.org/keywords/workflow","display_name":"Workflow","score":0.7137163877487183},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5619971752166748},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5443758964538574},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5335754752159119},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5150753855705261},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5067372918128967},{"id":"https://openalex.org/keywords/workflow-management-system","display_name":"Workflow management system","score":0.43274685740470886},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42620474100112915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2954319715499878},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1920369565486908},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17587324976921082},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.14012107253074646}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7928673624992371},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7804999351501465},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.7265775799751282},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.7137163877487183},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5619971752166748},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5443758964538574},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5335754752159119},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5150753855705261},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5067372918128967},{"id":"https://openalex.org/C140824633","wikidata":"https://www.wikidata.org/wiki/Q2808660","display_name":"Workflow management system","level":3,"score":0.43274685740470886},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42620474100112915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2954319715499878},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1920369565486908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17587324976921082},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.14012107253074646},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2487222.2487226","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2487222.2487226","pdf_url":null,"source":{"id":"https://openalex.org/S2642811","display_name":"ACM Transactions on Information and System Security","issn_l":"1094-9224","issn":["1094-9224","1557-7406"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Information and System Security","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.757.1434","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.757.1434","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1205.0852.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1138573040","display_name":null,"funder_award_id":"EP/K005162/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1544829330","https://openalex.org/W1570425181","https://openalex.org/W1590274425","https://openalex.org/W1676006881","https://openalex.org/W1849334378","https://openalex.org/W1964889053","https://openalex.org/W1976430052","https://openalex.org/W1991895580","https://openalex.org/W1995725694","https://openalex.org/W1999617330","https://openalex.org/W2007774531","https://openalex.org/W2031606427","https://openalex.org/W2038953226","https://openalex.org/W2043193943","https://openalex.org/W2057028717","https://openalex.org/W2068031952","https://openalex.org/W2074359677","https://openalex.org/W2074747980","https://openalex.org/W2076004681","https://openalex.org/W2107284348","https://openalex.org/W2119426781","https://openalex.org/W2122061707","https://openalex.org/W2133544949","https://openalex.org/W2134167896","https://openalex.org/W2134893444","https://openalex.org/W2141696417","https://openalex.org/W2157922724","https://openalex.org/W2162171351","https://openalex.org/W2166602595","https://openalex.org/W2171154705","https://openalex.org/W2911625174","https://openalex.org/W2913688336","https://openalex.org/W4230416342","https://openalex.org/W4292230561","https://openalex.org/W6661110980"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004","https://openalex.org/W4301903827"],"abstract_inverted_index":{"A":[0,36],"workflow":[1,37,52,77,88,123,135,153],"specification":[2,38,154],"defines":[3],"a":[4,72,96,152,229,237],"set":[5],"of":[6,26,33,49,83,111,145,198,205,219,226,234],"steps":[7,14,53],"and":[8,79,105,141,155,174],"the":[9,57,81,109,130,134,143,158,172,188,196,203,224,232],"order":[10],"in":[11,99,151,177,182,231],"which":[12,24,222],"these":[13,34],"must":[15],"be":[16,42,149],"executed.":[17],"Security":[18],"requirements":[19],"may":[20,148],"impose":[21],"constraints":[22,146],"on":[23],"groups":[25],"users":[27,50,199,227],"are":[28],"permitted":[29],"to":[30,41,51],"perform":[31],"subsets":[32],"steps.":[35,206],"is":[39,68,95,200],"said":[40],"satisfiable":[43],"if":[44],"there":[45],"exists":[46,67,214],"an":[47,65,93,178,192],"assignment":[48,66,94],"that":[54,115,147,157,176,210],"satisfies":[55],"all":[56],"constraints.":[58,166],"An":[59],"algorithm":[60],"for":[61,76,80,87,133,164,171,215],"determining":[62],"whether":[63],"such":[64,92,165,212],"important,":[69],"both":[70],"as":[71],"static":[73],"analysis":[74],"tool":[75],"specifications":[78],"construction":[82],"runtime":[84],"reference":[85],"monitors":[86],"management":[89],"systems.":[90],"Finding":[91],"hard":[97],"problem":[98,160,173],"general,":[100],"but":[101],"work":[102],"by":[103,228],"Wang":[104],"Li":[106],"[2010]":[107],"using":[108],"theory":[110],"parameterized":[112],"complexity":[113,131],"suggests":[114],"efficient":[116],"algorithms":[117],"exist":[118],"under":[119],"reasonable":[120],"assumptions":[121],"about":[122],"specifications.":[124],"In":[125],"this":[126,220],"article,":[127],"we":[128,168,185],"improve":[129],"bounds":[132,223],"satisfiability":[136,159],"problem.":[137],"We":[138,207],"also":[139,208],"generalize":[140],"extend":[142],"types":[144],"defined":[150],"prove":[156,175],"remains":[161],"fixed-parameter":[162],"tractable":[163],"Finally,":[167],"consider":[169],"preprocessing":[170],"important":[179],"special":[180],"case,":[181,221],"polynomial":[183,230],"time,":[184],"can":[186],"reduce":[187],"given":[189],"input":[190],"into":[191],"equivalent":[193],"one":[194],"where":[195],"number":[197,204,225,233],"at":[201],"most":[202],"show":[209],"no":[211],"reduction":[213],"two":[216],"natural":[217],"extensions":[218],"steps,":[235],"provided":[236],"widely":[238],"accepted":[239],"complexity-theoretical":[240],"assumption":[241],"holds.":[242]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}