{"id":"https://openalex.org/W2119426781","doi":"https://doi.org/10.1145/2382196.2382287","title":"On the parameterized complexity of the workflow satisfiability problem","display_name":"On the parameterized complexity of the workflow satisfiability problem","publication_year":2012,"publication_date":"2012-10-15","ids":{"openalex":"https://openalex.org/W2119426781","doi":"https://doi.org/10.1145/2382196.2382287","mag":"2119426781"},"language":"en","primary_location":{"id":"doi:10.1145/2382196.2382287","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2382196.2382287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM conference on Computer and communications security","raw_type":"proceedings-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, Egham, United Kingdom","Royal Holloway, University of London, Egham , United Kingdom"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"Royal Holloway, University of London, Egham , United Kingdom","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, Egham, United Kingdom","Royal Holloway, University of London, Egham , United Kingdom"],"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London, Egham, United Kingdom","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"Royal Holloway, University of London, Egham , United Kingdom","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, Johannesburg, South Africa"],"affiliations":[{"raw_affiliation_string":"University of Johannesburg, Johannesburg, South Africa","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":9.2259,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.9745479,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"857","last_page":"868"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10927","display_name":"Access Control and Trust","score":0.9994000196456909,"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.9994000196456909,"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.9976999759674072,"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.9969000220298767,"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/workflow","display_name":"Workflow","score":0.8552142977714539},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8526052236557007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7581210136413574},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6509471535682678},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.604067325592041},{"id":"https://openalex.org/keywords/workflow-management-system","display_name":"Workflow management system","score":0.544172465801239},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4939900040626526},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46112531423568726},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30287232995033264},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2578251361846924},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.2113557755947113}],"concepts":[{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.8552142977714539},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8526052236557007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7581210136413574},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6509471535682678},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.604067325592041},{"id":"https://openalex.org/C140824633","wikidata":"https://www.wikidata.org/wiki/Q2808660","display_name":"Workflow management system","level":3,"score":0.544172465801239},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4939900040626526},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46112531423568726},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30287232995033264},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2578251361846924},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.2113557755947113}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2382196.2382287","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2382196.2382287","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM conference on Computer and communications security","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W36639738","https://openalex.org/W1590274425","https://openalex.org/W1748315421","https://openalex.org/W1964889053","https://openalex.org/W1968319543","https://openalex.org/W1983032729","https://openalex.org/W1985572324","https://openalex.org/W1989358964","https://openalex.org/W1995725694","https://openalex.org/W1999617330","https://openalex.org/W2016639451","https://openalex.org/W2026753685","https://openalex.org/W2032856248","https://openalex.org/W2038953226","https://openalex.org/W2043193943","https://openalex.org/W2052773530","https://openalex.org/W2057028717","https://openalex.org/W2070051236","https://openalex.org/W2074359677","https://openalex.org/W2087638517","https://openalex.org/W2099980081","https://openalex.org/W2107284348","https://openalex.org/W2116087731","https://openalex.org/W2122061707","https://openalex.org/W2129023820","https://openalex.org/W2134850460","https://openalex.org/W2134893444","https://openalex.org/W2141696417","https://openalex.org/W2155002729","https://openalex.org/W2157743984","https://openalex.org/W2157922724","https://openalex.org/W2162171351","https://openalex.org/W2164680823","https://openalex.org/W2166566648","https://openalex.org/W2166602595","https://openalex.org/W2267233918","https://openalex.org/W2490706771","https://openalex.org/W2911625174","https://openalex.org/W2913688336","https://openalex.org/W2962968862","https://openalex.org/W3102379243"],"related_works":["https://openalex.org/W2375304607","https://openalex.org/W2391168633","https://openalex.org/W2035995658","https://openalex.org/W2353477037","https://openalex.org/W1574425962","https://openalex.org/W2385499106","https://openalex.org/W2354357087","https://openalex.org/W2352774566","https://openalex.org/W4243836028","https://openalex.org/W2376671203"],"abstract_inverted_index":{"A":[0,36],"workflow":[1,37,52,77,88,124,136,154],"specification":[2,38,155],"defines":[3],"a":[4,72,96,153],"set":[5],"of":[6,26,33,49,83,112,146],"steps":[7,14,53],"and":[8,79,105,142,156],"the":[9,57,81,110,131,135,144,159],"order":[10],"in":[11,99,107,152],"which":[12,24],"those":[13,34],"must":[15],"be":[16,42,150],"executed.":[17],"Security":[18],"requirements":[19],"may":[20,149],"impose":[21],"constraints":[22,147],"on":[23],"groups":[25],"users":[27,50],"are":[28],"permitted":[29],"to":[30,41,51],"perform":[31],"subsets":[32],"steps.":[35],"is":[39,68,95],"said":[40],"satisfiable":[43],"if":[44],"there":[45],"exists":[46,67],"an":[47,65,93],"assignment":[48,66,94],"that":[54,116,148,158],"satisfies":[55],"all":[56],"constraints.":[58,167],"An":[59],"algorithm":[60],"for":[61,76,80,87,134,165],"determining":[62],"whether":[63],"such":[64,92,166],"important,":[69],"both":[70],"as":[71],"static":[73],"analysis":[74],"tool":[75],"specifications,":[78],"construction":[82],"run-time":[84],"reference":[85],"monitors":[86],"management":[89],"systems.":[90],"Finding":[91],"hard":[97],"problem":[98,161],"general,":[100],"but":[101],"work":[102],"by":[103],"Wang":[104],"Li":[106],"2010":[108],"using":[109],"theory":[111],"parameterized":[113],"complexity":[114,132],"suggests":[115],"efficient":[117],"algorithms":[118],"exist":[119],"under":[120],"reasonable":[121],"assumptions":[122],"about":[123],"specifications.":[125],"In":[126],"this":[127],"paper,":[128],"we":[129],"improve":[130],"bounds":[133],"satisfiability":[137,160],"problem.":[138],"We":[139],"also":[140],"generalize":[141],"extend":[143],"types":[145],"defined":[151],"prove":[157],"remains":[162],"fixed-parameter":[163],"tractable":[164]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}