{"id":"https://openalex.org/W4366503778","doi":"https://doi.org/10.1007/978-3-031-30829-1_14","title":"Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains","display_name":"Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4366503778","doi":"https://doi.org/10.1007/978-3-031-30829-1_14"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-30829-1_14","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30829-1_14","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30829-1_14.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-30829-1_14.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062705081","display_name":"Amgad M. Rady","orcid":"https://orcid.org/0000-0002-8066-3482"},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Amgad Rady","raw_affiliation_strings":["DisCoVeri Group, Department of Electrical Engineering and Computer Science, York University, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"DisCoVeri Group, Department of Electrical Engineering and Computer Science, York University, Toronto, Canada","institution_ids":["https://openalex.org/I192455969"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014089511","display_name":"Franck van Breugel","orcid":"https://orcid.org/0009-0002-7320-1527"},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Franck van Breugel","raw_affiliation_strings":["DisCoVeri Group, Department of Electrical Engineering and Computer Science, York University, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"DisCoVeri Group, Department of Electrical Engineering and Computer Science, York University, Toronto, Canada","institution_ids":["https://openalex.org/I192455969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062705081"],"corresponding_institution_ids":["https://openalex.org/I192455969"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.9782,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.72774869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"285","last_page":"307"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9947999715805054,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.9060893058776855},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.8287232518196106},{"id":"https://openalex.org/keywords/probabilistic-ctl","display_name":"Probabilistic CTL","score":0.6246491074562073},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5959567427635193},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5214056968688965},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.5073506236076355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4808264970779419},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47671905159950256},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4660191535949707},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.45459985733032227},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44901958107948303},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40474891662597656},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.23082002997398376},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13877993822097778},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0650230348110199},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.059607237577438354}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.9060893058776855},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.8287232518196106},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.6246491074562073},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5959567427635193},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5214056968688965},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.5073506236076355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4808264970779419},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47671905159950256},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4660191535949707},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.45459985733032227},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44901958107948303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40474891662597656},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.23082002997398376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13877993822097778},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0650230348110199},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.059607237577438354},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-30829-1_14","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30829-1_14","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30829-1_14.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"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-30829-1_14","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-30829-1_14","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-30829-1_14.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":[{"display_name":"Reduced inequalities","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320290","display_name":"University of Oxford","ror":"https://ror.org/052gg0110"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4366503778.pdf"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W114619224","https://openalex.org/W173641204","https://openalex.org/W176827812","https://openalex.org/W180602404","https://openalex.org/W1490544922","https://openalex.org/W1531625469","https://openalex.org/W1539697848","https://openalex.org/W1547562281","https://openalex.org/W1589421353","https://openalex.org/W1591992921","https://openalex.org/W1604297451","https://openalex.org/W1862398452","https://openalex.org/W1865728679","https://openalex.org/W1992008267","https://openalex.org/W2015172530","https://openalex.org/W2031728268","https://openalex.org/W2044811734","https://openalex.org/W2052404333","https://openalex.org/W2093397547","https://openalex.org/W2107471150","https://openalex.org/W2108489993","https://openalex.org/W2108886305","https://openalex.org/W2135115058","https://openalex.org/W2137865376","https://openalex.org/W2140908765","https://openalex.org/W2149481500","https://openalex.org/W2157977984","https://openalex.org/W2527841536","https://openalex.org/W2534853293","https://openalex.org/W2593267253","https://openalex.org/W2810752651","https://openalex.org/W2904057364","https://openalex.org/W2949241705","https://openalex.org/W3007331800","https://openalex.org/W3040048066","https://openalex.org/W3082953669","https://openalex.org/W3139172074","https://openalex.org/W3140293358","https://openalex.org/W3158463888","https://openalex.org/W3176847254","https://openalex.org/W4250143427","https://openalex.org/W4291236916","https://openalex.org/W6894019932"],"related_works":["https://openalex.org/W1497573972","https://openalex.org/W2138707849","https://openalex.org/W2289277223","https://openalex.org/W2749065928","https://openalex.org/W1499367685","https://openalex.org/W4238495367","https://openalex.org/W90591307","https://openalex.org/W2225666389","https://openalex.org/W2289944023","https://openalex.org/W2371210594"],"abstract_inverted_index":{"Abstract":[0],"Probabilistic":[1],"bisimilarity":[2,49,99,136,194],"distances":[3,50,100],"measure":[4],"the":[5,18,23,66,80,95,134,139,179,182,192],"similarity":[6,81],"of":[7,9,11,57,68,82,97,118,126,130,138,191],"behaviour":[8],"states":[10,58,70,127],"a":[12,115,128,188],"labelled":[13,52],"Markov":[14,53],"chain.":[15],"The":[16],"smaller":[17],"distance":[19,29,67,137],"between":[20],"two":[21,69,110],"states,":[22],"more":[24,108],"alike":[25],"they":[26,36],"behave.":[27],"Their":[28],"is":[30,71,168],"zero":[31],"if":[32,35,172],"and":[33,106,150],"only":[34],"are":[37],"probabilistic":[38,48,98,135,193],"bisimilar.":[39],"Recently,":[40],"algorithms":[41],"have":[42],"been":[43],"developed":[44],"that":[45,65,77,132,146,153,165],"can":[46,156],"compute":[47,64],"for":[51,123],"chains":[54],"with":[55],"thousands":[56],"within":[59],"seconds.":[60],"However,":[61],"say":[62],"we":[63,88,142,151,173],"0.125.":[72],"How":[73],"does":[74],"one":[75],"explain":[76],"0.125":[78],"captures":[79],"their":[83,119],"behaviour?":[84],"In":[85],"this":[86,90],"paper,":[87],"address":[89],"question":[91],"by":[92,102],"returning":[93],"to":[94,121],"definition":[96],"proposed":[101],"Desharnais,":[103],"Gupta,":[104],"Jagadeesan,":[105],"Panangaden":[107],"than":[109],"decades":[111],"ago.":[112],"We":[113,162],"use":[114],"slight":[116],"variation":[117],"logic":[120,167,184],"construct":[122],"each":[124,154],"pair":[125],"sequence":[129],"formulas":[131,149],"explains":[133],"states.":[140],"Furthermore,":[141],"present":[143],"an":[144],"algorithm":[145],"computes":[147],"those":[148],"show":[152],"formula":[155],"be":[157],"computed":[158],"in":[159],"polynomial":[160],"time.":[161],"also":[163],"prove":[164],"our":[166],"minimal.":[169],"That":[170],"is,":[171],"leave":[174],"out":[175],"any":[176],"operator":[177],"from":[178],"logic,":[180],"then":[181],"resulting":[183],"no":[185],"longer":[186],"provides":[187],"logical":[189],"characterization":[190],"distances.":[195]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}