{"id":"https://openalex.org/W4315606538","doi":"https://doi.org/10.1145/3571230","title":"A Robust Theory of Series Parallel Graphs","display_name":"A Robust Theory of Series Parallel Graphs","publication_year":2023,"publication_date":"2023-01-09","ids":{"openalex":"https://openalex.org/W4315606538","doi":"https://doi.org/10.1145/3571230"},"language":"en","primary_location":{"id":"doi:10.1145/3571230","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571230","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571230","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3571230","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065059795","display_name":"Rajeev Alur","orcid":"https://orcid.org/0000-0003-1733-7083"},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajeev Alur","raw_affiliation_strings":["University of Pennsylvania, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, USA","institution_ids":["https://openalex.org/I36788626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019472033","display_name":"Caleb Stanford","orcid":"https://orcid.org/0000-0002-8428-7736"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Caleb Stanford","raw_affiliation_strings":["University of California at San Diego, USA / University of California at Davis, USA"],"affiliations":[{"raw_affiliation_string":"University of California at San Diego, USA / University of California at Davis, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007315898","display_name":"Christopher Watson","orcid":"https://orcid.org/0000-0003-3716-516X"},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christopher Watson","raw_affiliation_strings":["University of Pennsylvania, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, USA","institution_ids":["https://openalex.org/I36788626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065059795"],"corresponding_institution_ids":["https://openalex.org/I36788626"],"apc_list":null,"apc_paid":null,"fwci":1.5635,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.8475375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"7","issue":"POPL","first_page":"1058","last_page":"1088"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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/T11567","display_name":"semigroups and automata theory","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9983000159263611,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9977999925613403,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7474521398544312},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5076490640640259},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4855618178844452},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47108709812164307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4491894841194153},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42560967803001404},{"id":"https://openalex.org/keywords/succinctness","display_name":"Succinctness","score":0.424843966960907},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42252838611602783},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3350573778152466},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2990340292453766}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7474521398544312},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5076490640640259},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4855618178844452},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47108709812164307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4491894841194153},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42560967803001404},{"id":"https://openalex.org/C2776493592","wikidata":"https://www.wikidata.org/wiki/Q5158717","display_name":"Succinctness","level":2,"score":0.424843966960907},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42252838611602783},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3350573778152466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2990340292453766}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3571230","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571230","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571230","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3571230","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3571230","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3571230","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"},{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G2184710878","display_name":null,"funder_award_id":"CCF 1763514","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4234623774","display_name":null,"funder_award_id":"1763514","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4315606538.pdf","grobid_xml":"https://content.openalex.org/works/W4315606538.grobid-xml"},"referenced_works_count":63,"referenced_works":["https://openalex.org/W127565347","https://openalex.org/W1486467946","https://openalex.org/W1501952738","https://openalex.org/W1505425738","https://openalex.org/W1529497146","https://openalex.org/W1532092302","https://openalex.org/W1540999307","https://openalex.org/W1542510688","https://openalex.org/W1546126118","https://openalex.org/W1568320863","https://openalex.org/W1570009926","https://openalex.org/W1573343649","https://openalex.org/W1573649122","https://openalex.org/W1582747324","https://openalex.org/W1619948012","https://openalex.org/W1748927325","https://openalex.org/W2001474264","https://openalex.org/W2008958263","https://openalex.org/W2012833332","https://openalex.org/W2014144140","https://openalex.org/W2015640848","https://openalex.org/W2023478510","https://openalex.org/W2024680396","https://openalex.org/W2028357390","https://openalex.org/W2035020702","https://openalex.org/W2038404317","https://openalex.org/W2045594629","https://openalex.org/W2050852272","https://openalex.org/W2056665285","https://openalex.org/W2063123613","https://openalex.org/W2064937152","https://openalex.org/W2073663206","https://openalex.org/W2074048601","https://openalex.org/W2081396910","https://openalex.org/W2082171780","https://openalex.org/W2099395665","https://openalex.org/W2108138932","https://openalex.org/W2113800199","https://openalex.org/W2131886132","https://openalex.org/W2135216003","https://openalex.org/W2151033407","https://openalex.org/W2157529519","https://openalex.org/W2177814128","https://openalex.org/W2285849266","https://openalex.org/W2295923951","https://openalex.org/W2295931013","https://openalex.org/W2460699391","https://openalex.org/W2521218765","https://openalex.org/W2676873924","https://openalex.org/W2804589645","https://openalex.org/W2912196347","https://openalex.org/W2955965928","https://openalex.org/W2983035735","https://openalex.org/W3005147078","https://openalex.org/W3103882277","https://openalex.org/W3159683821","https://openalex.org/W3210466936","https://openalex.org/W3214872226","https://openalex.org/W4211152277","https://openalex.org/W4220981905","https://openalex.org/W4232306982","https://openalex.org/W4237412827","https://openalex.org/W4251691259"],"related_works":["https://openalex.org/W2359995945","https://openalex.org/W2170813354","https://openalex.org/W2804031838","https://openalex.org/W2060032524","https://openalex.org/W1988549452","https://openalex.org/W2173721792","https://openalex.org/W2044007894","https://openalex.org/W201930674","https://openalex.org/W1965253335","https://openalex.org/W2124638910"],"abstract_inverted_index":{"Motivated":[0],"by":[1,49,104,156],"distributed":[2],"data":[3],"processing":[4],"applications,":[5],"we":[6],"introduce":[7],"a":[8,87,165,171,190,201,226],"class":[9],"of":[10,74,101,122,154,160,173,183,228,236],"labeled":[11],"directed":[12],"acyclic":[13],"graphs":[14,38,80],"constructed":[15],"using":[16],"sequential":[17],"and":[18,22,25,33,53,63,69,131,196,209,213],"parallel":[19,84],"composition":[20,61,85],"operations,":[21],"study":[23],"automata":[24,225],"logics":[26],"over":[27,36],"them.":[28],"We":[29,57],"show":[30],"that":[31,83,139,176],"deterministic":[32,202],"non-deterministic":[34],"acceptors":[35],"such":[37,105],"have":[39],"the":[40,54,91,97,110,119,141,144,180],"same":[41],"expressive":[42],"power,":[43],"which":[44,113],"can":[45],"be":[46,116,220],"equivalently":[47],"characterized":[48],"Monadic":[50],"Second-Order":[51],"logic":[52],"graded":[55],"\u00b5-calculus.":[56],"establish":[58],"closure":[59],"under":[60],"operations":[62],"decision":[64],"procedures":[65],"for":[66,118,150,223],"membership,":[67],"emptiness,":[68],"inclusion.":[70],"A":[71],"key":[72],"feature":[73,137],"our":[75],"graphs,":[76],"called":[77],"synchronized":[78],"series-parallel":[79,123],"(SSPG),":[81],"is":[82,107,177],"introduces":[86],"synchronization":[88],"edge":[89],"from":[90,179],"newly":[92],"introduced":[93],"source":[94],"vertex":[95],"to":[96,109,148,164,170,200,219],"sink.":[98],"The":[99,135,186],"transfer":[100],"information":[102],"enabled":[103],"edges":[106],"crucial":[108],"determinization":[111,187],"construction,":[112],"would":[114],"not":[115],"possible":[117],"traditional":[120],"definition":[121],"graphs.":[124],"SSPGs":[125],"allow":[126],"both":[127,214],"ordered":[128],"ranked":[129],"parallelism":[130],"unordered":[132],"unranked":[133],"parallelism.":[134],"latter":[136],"means":[138],"in":[140],"corresponding":[142],"automata,":[143],"transition":[145],"function":[146],"needs":[147],"account":[149],"an":[151],"arbitrary":[152],"number":[153],"predecessors":[155],"counting":[157,174,198,211,231],"each":[158],"type":[159],"state":[161,184],"only":[162],"up":[163],"specified":[166],"constant,":[167],"thus":[168],"leading":[169],"notion":[172,182],"complexity":[175,199,232],"distinct":[178],"classical":[181],"complexity.":[185],"construction":[188],"translates":[189],"nondeterministic":[191,224],"automaton":[192,203],"with":[193,204],"n":[194,206],"states":[195,208],"k":[197],"2":[205,207,229],"kn":[210],"complexity,":[212],"these":[215],"bounds":[216],"are":[217],"shown":[218],"tight.":[221],"Furthermore,":[222],"bound":[227],"on":[230],"suffices":[233],"without":[234],"loss":[235],"expressiveness.":[237]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}