{"id":"https://openalex.org/W2880875791","doi":"https://doi.org/10.1145/3210257","title":"Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components","display_name":"Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components","publication_year":2018,"publication_date":"2018-07-05","ids":{"openalex":"https://openalex.org/W2880875791","doi":"https://doi.org/10.1145/3210257","mag":"2880875791"},"language":"en","primary_location":{"id":"doi:10.1145/3210257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210257","pdf_url":null,"source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"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 Programming Languages and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1473666","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052607806","display_name":"Krishnendu Chatterjee","orcid":"https://orcid.org/0000-0002-4561-241X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Krishnendu Chatterjee","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072999400","display_name":"Rasmus Ibsen-Jensen","orcid":"https://orcid.org/0000-0003-4783-0389"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Rasmus Ibsen-Jensen","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005241421","display_name":"Amir Kafshdar Goharshady","orcid":"https://orcid.org/0000-0003-1702-6584"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Amir Kafshdar Goharshady","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022252401","display_name":"Andreas Pavlogiannis","orcid":"https://orcid.org/0000-0002-8943-0722"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Andreas Pavlogiannis","raw_affiliation_strings":["IST Austria, Klosterneuburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157556583"],"apc_list":null,"apc_paid":null,"fwci":1.6483,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.8575972,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"40","issue":"3","first_page":"1","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.8552404046058655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7945175170898438},{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.6888824701309204},{"id":"https://openalex.org/keywords/semiring","display_name":"Semiring","score":0.6197385191917419},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5924856066703796},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4552546739578247},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4443019926548004},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.438096284866333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3777995705604553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31243598461151123},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23621174693107605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1982918083667755},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16087326407432556},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14518481492996216}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.8552404046058655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7945175170898438},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.6888824701309204},{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.6197385191917419},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5924856066703796},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4552546739578247},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4443019926548004},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.438096284866333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3777995705604553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31243598461151123},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23621174693107605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1982918083667755},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16087326407432556},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14518481492996216},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3210257","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210257","pdf_url":null,"source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"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 Programming Languages and Systems","raw_type":"journal-article"},{"id":"pmh:oai:repository.ust.hk:1783.1-107135","is_oa":false,"landing_page_url":"http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000444694800001","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:zenodo.org:1473666","is_oa":true,"landing_page_url":"https://zenodo.org/record/1473666","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Programming Languages and Systems 40(3)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1473666","is_oa":true,"landing_page_url":"https://zenodo.org/record/1473666","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Programming Languages and Systems 40(3)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":79,"referenced_works":["https://openalex.org/W41457056","https://openalex.org/W104370704","https://openalex.org/W854382448","https://openalex.org/W1493367105","https://openalex.org/W1505355949","https://openalex.org/W1507006488","https://openalex.org/W1527664624","https://openalex.org/W1545371423","https://openalex.org/W1569998753","https://openalex.org/W1570445666","https://openalex.org/W1576925855","https://openalex.org/W1584814208","https://openalex.org/W1598142426","https://openalex.org/W1604214744","https://openalex.org/W1604784085","https://openalex.org/W1607605746","https://openalex.org/W1818617877","https://openalex.org/W1821417028","https://openalex.org/W1842117537","https://openalex.org/W1846157972","https://openalex.org/W1911833263","https://openalex.org/W1970363544","https://openalex.org/W1973046087","https://openalex.org/W1982335633","https://openalex.org/W1989556004","https://openalex.org/W1991133427","https://openalex.org/W1991755800","https://openalex.org/W2002722727","https://openalex.org/W2006084860","https://openalex.org/W2007572995","https://openalex.org/W2008440715","https://openalex.org/W2011999472","https://openalex.org/W2016056456","https://openalex.org/W2017492235","https://openalex.org/W2022363576","https://openalex.org/W2022980325","https://openalex.org/W2033942886","https://openalex.org/W2036157748","https://openalex.org/W2036772106","https://openalex.org/W2039829163","https://openalex.org/W2055545029","https://openalex.org/W2059372025","https://openalex.org/W2063284732","https://openalex.org/W2065818693","https://openalex.org/W2071362870","https://openalex.org/W2074131210","https://openalex.org/W2076285066","https://openalex.org/W2080573945","https://openalex.org/W2080696000","https://openalex.org/W2087046173","https://openalex.org/W2094596738","https://openalex.org/W2098645109","https://openalex.org/W2104734478","https://openalex.org/W2116888614","https://openalex.org/W2119468705","https://openalex.org/W2124153277","https://openalex.org/W2125690626","https://openalex.org/W2130851407","https://openalex.org/W2133853963","https://openalex.org/W2143406303","https://openalex.org/W2146507303","https://openalex.org/W2151617868","https://openalex.org/W2153715991","https://openalex.org/W2155962559","https://openalex.org/W2159003936","https://openalex.org/W2160520283","https://openalex.org/W2165546792","https://openalex.org/W2166091242","https://openalex.org/W2169304846","https://openalex.org/W2227557434","https://openalex.org/W2294334272","https://openalex.org/W2734444937","https://openalex.org/W2735509417","https://openalex.org/W2885877860","https://openalex.org/W2914617426","https://openalex.org/W2952925858","https://openalex.org/W2986773320","https://openalex.org/W4214848047","https://openalex.org/W4248607285"],"related_works":["https://openalex.org/W2998381397","https://openalex.org/W185248416","https://openalex.org/W4236419692","https://openalex.org/W3167919718","https://openalex.org/W4239447582","https://openalex.org/W4251718783","https://openalex.org/W2171015181","https://openalex.org/W4225271228","https://openalex.org/W1484403103","https://openalex.org/W2076508696"],"abstract_inverted_index":{"We":[0,47,72],"study":[1,87],"algorithmic":[2],"questions":[3],"wrt":[4],"algebraic":[5,25],"path":[6,26,35,284],"properties":[7,27],"in":[8,44,81,189,202,224,234,247,273,286],"concurrent":[9,54,191],"systems,":[10],"where":[11],"the":[12,15,33,53,66,95,98,102,114,122,127,133,140,144,169,174,183,196,203,214,241,259,278,282],"transitions":[13],"of":[14,52,69,88,101,117,146,173,185,193,263],"system":[16,55,192],"are":[17,164],"labeled":[18],"from":[19],"a":[20,57,62,136,190],"complete,":[21],"closed":[22],"semiring.":[23],"The":[24,86,110],"can":[28,231,244],"model":[29],"dataflow":[30,84],"analysis":[31],"problems,":[32],"shortest":[34,283],"problem,":[36],"and":[37,105,120,158,177,239],"many":[38],"other":[39],"natural":[40],"problems":[41],"that":[42,49,166,220,258,293],"arise":[43,79],"program":[45],"analysis.":[46,85],"consider":[48,94],"each":[50,107,228],"component":[51],"is":[56],"graph":[58,116,124,274],"with":[59,221],"constant":[60],"treewidth,":[61],"property":[63],"satisfied":[64],"by":[65],"controlflow":[67],"graphs":[68],"most":[70,236],"programs.":[71],"allow":[73],"for":[74,106,154,206,281],"multiple":[75,89],"possible":[76,148],"queries,":[77],"which":[78,150],"naturally":[80],"demand":[82],"driven":[83],"queries":[90],"allows":[91],"us":[92],"to":[93,135],"tradeoff":[96,155],"between":[97,156],"resource":[99],"usage":[100],"one-time":[103,222],"preprocessing":[104,157,223],"individual":[108],"query.":[109],"traditional":[111,175,197],"approach":[112,198],"constructs":[113],"product":[115],"all":[118,147],"components":[119],"applies":[121],"best-known":[123],"algorithm":[125],"on":[126,182,298],"product.":[128],"In":[129],"this":[130],"approach,":[131,176],"even":[132,240],"answer":[134],"single":[137],"query":[138,159,209,230],"requires":[139,199],"transitive":[141,215,242],"closure":[142,243],"(i.e.,":[143,276],"results":[145,256,291],"queries),":[149],"provides":[151],"no":[152],"room":[153],"time.":[160,250],"Our":[161],"main":[162],"contributions":[163],"algorithms":[165,265,275,295],"significantly":[167],"improve":[168],"worst-case":[170,260,279],"running":[171,261],"time":[172,201,262],"provide":[178],"various":[179],"tradeoffs":[180],"depending":[181],"number":[184],"queries.":[186],"For":[187],"example,":[188],"two":[194],"components,":[195],"hexic":[200],"worst":[204],"case":[205],"answering":[207],"one":[208],"as":[210,212],"well":[211],"computing":[213],"closure,":[216],"whereas":[217],"we":[218,252],"show":[219,292],"almost":[225,248],"cubic":[226],"time,":[227,238],"subsequent":[229],"be":[232,245,267],"answered":[233],"at":[235],"linear":[237],"computed":[246],"quartic":[249],"Furthermore,":[251],"establish":[253],"conditional":[254],"optimality":[255],"showing":[257],"our":[264,294],"cannot":[266],"improved":[268],"without":[269],"achieving":[270],"major":[271],"breakthroughs":[272],"improving":[277],"bound":[280],"problem":[285],"general":[287],"graphs).":[288],"Preliminary":[289],"experimental":[290],"perform":[296],"favorably":[297],"several":[299],"benchmarks.":[300]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}