{"id":"https://openalex.org/W4393942713","doi":"https://doi.org/10.1007/978-3-031-57256-2_6","title":"Fast Symbolic Computation of Bottom SCCs","display_name":"Fast Symbolic Computation of Bottom SCCs","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4393942713","doi":"https://doi.org/10.1007/978-3-031-57256-2_6"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-57256-2_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-57256-2_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-57256-2_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-57256-2_6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069791416","display_name":"Anna Blume Jakobsen","orcid":"https://orcid.org/0009-0005-7892-7230"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Anna Blume Jakobsen","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106038724","display_name":"Rasmus Skibdahl Melanchton J\u00f8rgensen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rasmus Skibdahl Melanchton J\u00f8rgensen","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012697499","display_name":"Jaco van de Pol","orcid":"https://orcid.org/0000-0003-4305-0625"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Jaco van de Pol","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"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/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Andreas Pavlogiannis","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069791416"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14790195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"110","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8563181161880493},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6530663967132568},{"id":"https://openalex.org/keywords/top-down-and-bottom-up-design","display_name":"Top-down and bottom-up design","score":0.5324218273162842},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39495301246643066},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.3502112925052643},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.34210002422332764}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8563181161880493},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6530663967132568},{"id":"https://openalex.org/C135798126","wikidata":"https://www.wikidata.org/wiki/Q2167279","display_name":"Top-down and bottom-up design","level":2,"score":0.5324218273162842},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39495301246643066},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.3502112925052643},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.34210002422332764}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-031-57256-2_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-57256-2_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-57256-2_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/0890f501-6e40-45e8-9591-fefebb380279","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85192224735&partnerID=8YFLogxK","pdf_url":"https://pure.au.dk/ws/files/453142751/978-3-031-57256-2_6.pdf","source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jakobsen, A B, J\u00f8rgensen, R S M, van de Pol, J & Pavlogiannis, A 2024, Fast Symbolic Computation of Bottom SCCs. in B Finkbeiner & L Kov\u00e1cs (eds), Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2024. Springer, Cham, Lecture Notes in Computer Science, vol. 14572 LNCS, pp. 110-128, 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2024, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, 06/04/2024. https://doi.org/10.1007/978-3-031-57256-2_6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:openaire/0890f501-6e40-45e8-9591-fefebb380279","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/0890f501-6e40-45e8-9591-fefebb380279","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jakobsen, A B, J\u00f8rgensen, R S M, van de Pol, J & Pavlogiannis, A 2024, Fast Symbolic Computation of Bottom SCCs. in B Finkbeiner & L Kov\u00e1cs (eds), Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2024. Springer, Cham, Lecture Notes in Computer Science, vol. 14572 LNCS, pp. 110-128, 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2024, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, 06/04/2024. https://doi.org/10.1007/978-3-031-57256-2_6","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-57256-2_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-57256-2_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-57256-2_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4834617424","display_name":null,"funder_award_id":"VIL42117","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4393942713.pdf"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W40595619","https://openalex.org/W125115239","https://openalex.org/W1488279842","https://openalex.org/W1489391022","https://openalex.org/W1541059630","https://openalex.org/W1544607874","https://openalex.org/W1575555944","https://openalex.org/W1654252768","https://openalex.org/W1862398452","https://openalex.org/W1864649459","https://openalex.org/W1981898075","https://openalex.org/W1999354872","https://openalex.org/W2020306722","https://openalex.org/W2030224590","https://openalex.org/W2031522732","https://openalex.org/W2057312772","https://openalex.org/W2067463757","https://openalex.org/W2092996669","https://openalex.org/W2114817689","https://openalex.org/W2149020136","https://openalex.org/W2534303543","https://openalex.org/W2901878185","https://openalex.org/W2944603686","https://openalex.org/W2963712274","https://openalex.org/W3183793525","https://openalex.org/W3197087976","https://openalex.org/W4214723139","https://openalex.org/W4250417675","https://openalex.org/W4251228600","https://openalex.org/W4366451101"],"related_works":["https://openalex.org/W1543048115","https://openalex.org/W22958017","https://openalex.org/W2438475373","https://openalex.org/W4231775656","https://openalex.org/W2046435967","https://openalex.org/W563065917","https://openalex.org/W2383646825","https://openalex.org/W2371018915","https://openalex.org/W2064871819","https://openalex.org/W2033087242"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"computation":[2,44,126],"of":[3,23,45,102,174,180,217],"bottom":[4],"strongly":[5],"connected":[6],"components":[7],"(BSCCs)":[8],"is":[9,56,138,165,200],"a":[10,83,150],"fundamental":[11],"task":[12],"in":[13,19,92,141],"model":[14],"checking,":[15],"as":[16,18,52,54],"well":[17],"characterizing":[20],"the":[21,40,43,99,125,162,178,204,215],"attractors":[22],"dynamical":[24],"systems.":[25],"As":[26],"such,":[27],"symbolic":[28,85,94],"algorithms":[29],"for":[30,87,208],"BSCCs":[31,89,160],"have":[32],"received":[33],"special":[34],"attention,":[35],"and":[36,136],"are":[37,130,145],"based":[38],"on":[39,170],"idea":[41],"that":[42,129,144,156],"an":[46],"SCC":[47],"can":[48],"be":[49,59],"stopped":[50],"early,":[51],"soon":[53],"it":[55],"deemed":[57],"to":[58,98,123,132,134],"non-bottom.":[60,146],"In":[61,96],"this":[62],"paper":[63],"we":[64,148],"introduce":[65],"$$\\textsc":[66,106,184],"{Pendant}$$":[67,107,185],"<mml:math":[68,108,186],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[69,109,187],"<mml:mrow>":[70,110,188],"<mml:mi>P</mml:mi>":[71,111,189],"<mml:mstyle>":[72,112,190],"<mml:mi>E</mml:mi>":[73,113,191],"<mml:mi>N</mml:mi>":[74,77,114,117,192,195],"<mml:mi>D</mml:mi>":[75,115,193],"<mml:mi>A</mml:mi>":[76,116,194],"<mml:mi>T</mml:mi>":[78,118,196],"</mml:mstyle>":[79,119,197],"</mml:mrow>":[80,120,198],"</mml:math>":[81,121,199],",":[82],"new":[84],"algorithm":[86,164,207,219],"computing":[88],"which":[90],"runs":[91],"linear":[93],"time.":[95],"contrast":[97],"standard":[100,205],"approach":[101],"escaping":[103],"non-bottom":[104],"SCCs,":[105],"aims":[122],"start":[124],"from":[127],"nodes":[128],"likely":[131],"belong":[133],"BSCCs,":[135],"thus":[137],"more":[139],"effective":[140],"sidestepping":[142],"SCCs":[143],"Moreover,":[147],"employ":[149],"simple":[151],"yet":[152],"powerful":[153],"deadlock-detection":[154],"technique,":[155],"quickly":[157],"identifies":[158],"singleton":[159],"before":[161],"main":[163],"run.":[166],"Our":[167],"experimental":[168],"evaluation":[169],"three":[171],"diverse":[172],"datasets":[173],"553":[175],"models":[176],"demonstrates":[177],"efficacy":[179],"our":[181],"two":[182],"methods:":[183],"decisively":[201],"faster":[202],"than":[203],"existing":[206],"BSCC":[209],"computation,":[210],"while":[211],"deadlock":[212],"detection":[213],"improves":[214],"performance":[216],"each":[218],"significantly.":[220]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}