{"id":"https://openalex.org/W7166875162","doi":"https://doi.org/10.4230/lipics.icalp.2026.166","title":"The Complexity of Bisimilarity and Model Checking in Finitary Diagrams","display_name":"The Complexity of Bisimilarity and Model Checking in Finitary Diagrams","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166875162","doi":"https://doi.org/10.4230/lipics.icalp.2026.166"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26554","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.166","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.166/LIPIcs.ICALP.2026.166.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.166/LIPIcs.ICALP.2026.166.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035530886","display_name":"Markus Bl\u00e4ser","orcid":"https://orcid.org/0000-0002-1750-9036"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bl\u00e4ser, Markus","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1750-9036","affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032506960","display_name":"S. P. Dutta","orcid":"https://orcid.org/0000-0003-0929-6082"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dutta, Sagnik","raw_affiliation_strings":["Max Planck Institut f\u00fcr Informatik, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0929-6082","affiliations":[{"raw_affiliation_string":"Max Planck Institut f\u00fcr Informatik, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5139738484","display_name":"Samuel Okyay","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Okyay, Samuel","raw_affiliation_strings":["Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71942279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.296999990940094,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.296999990940094,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.1590999960899353,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.066600002348423,"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/finitary","display_name":"Finitary","score":0.9628999829292297},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5238000154495239},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5228000283241272},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4973999857902527},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.49219998717308044},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.47099998593330383},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.43869999051094055},{"id":"https://openalex.org/keywords/event","display_name":"Event (particle physics)","score":0.3959999978542328},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.3815000057220459}],"concepts":[{"id":"https://openalex.org/C2778003309","wikidata":"https://www.wikidata.org/wiki/Q5450381","display_name":"Finitary","level":2,"score":0.9628999829292297},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6761999726295471},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5260999798774719},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5238000154495239},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5228000283241272},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4973999857902527},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.49219998717308044},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.43869999051094055},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.3815000057220459},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3596000075340271},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.33250001072883606},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3154999911785126},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.29030001163482666},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.2635999917984009},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26554","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.166","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.166/LIPIcs.ICALP.2026.166.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.icalp.2026.166","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.166","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26554","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.166","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.166/LIPIcs.ICALP.2026.166.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166875162.pdf","grobid_xml":"https://content.openalex.org/works/W7166875162.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Inspired":[0],"by":[1,118],"the":[2,37,41,44,88,115,148,186,210,225,231,235,242],"work":[3,117],"of":[4,36,40,47,90,128,161,175,216,234,241],"Dubut,":[5,119],"Goubault,":[6],"and":[7,20,23,71,86,131,164],"Goubault-Larrecq":[8],"(ICALP":[9],"2015)":[10],"on":[11],"natural":[12],"homology,":[13],"Dubut":[14],"(RAMiCS":[15],"2020)":[16],"introduces":[17,153],"finitary":[18,63,94,129,168],"diagrams":[19,130,169],"studies":[21],"bisimilarity":[22,65,127,179],"diagrammatic":[24,75,137],"path":[25,76,138,176],"logics":[26],"for":[27,56,62,74,93,110,126,136,147,173],"them.":[28],"To":[29],"this":[30,57,113,223],"aim,":[31],"he":[32,59],"defines":[33],"a":[34,52,143,238],"fragment":[35,227],"existential":[38,45,232],"theory":[39,46,233],"reals,":[42,236],"called":[43],"invertible":[48,196],"matrices":[49,208],"(ETIM).":[50],"Using":[51],"PSPACE":[53],"upper":[54,124,134,187],"bound":[55,125,135,188],"fragment,":[58],"proves":[60],"that":[61,103,214,221],"diagrams,":[64],"can":[66],"be":[67,160],"decided":[68],"in":[69,78,222],"EXPSPACE":[70],"model":[72,91],"checking":[73,92],"logic":[77],"PSPACE.":[79,190],"We":[80,140,198,219],"significantly":[81],"improve":[82,185],"both":[83],"these":[84],"bounds":[85],"settle":[87],"complexity":[89],"diagrams.":[95],"As":[96],"our":[97],"first":[98],"main":[99],"result,":[100],"we":[101,120,183,193,204],"show":[102,220],"there":[104],"is":[105,228],"an":[106,122,132],"efficient":[107],"randomized":[108],"algorithm":[109],"ETIM.":[111],"Combining":[112],"with":[114],"previous":[116],"obtain":[121],"NEXP":[123],"NP":[133],"logic.":[139],"also":[141],"provide":[142],"matching":[144],"NP-hardness":[145],"proof":[146,152],"latter.":[149],"The":[150],"hardness":[151],"constrained":[154],"layered":[155],"poset":[156],"problems,":[157],"which":[158],"may":[159],"independent":[162],"interest,":[163],"connects":[165],"them":[166],"to":[167,189,230],"using":[170],"Gabriel\u2019s":[171],"theorem":[172],"representations":[174],"quivers.":[177],"For":[178],"over":[180,195,207],"finite":[181],"fields,":[182],"further":[184],"In":[191],"ETIM,":[192],"quantify":[194,206],"matrices.":[197],"finally":[199],"ask":[200],"what":[201],"happens":[202],"if":[203],"instead":[205],"from":[209],"special":[211],"linear":[212,244],"group,":[213],"is,":[215],"determinant":[217],"one.":[218],"case,":[224],"resulting":[226],"equivalent":[229],"under":[237],"mild":[239],"generalization":[240],"allowed":[243],"constraints.":[245]},"counts_by_year":[],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2026-07-02T00:00:00"}