{"id":"https://openalex.org/W2963120624","doi":"https://doi.org/10.23638/lmcs-13(2:13)2017","title":"On-the-Fly Computation of Bisimilarity Distances","display_name":"On-the-Fly Computation of Bisimilarity Distances","publication_year":2017,"publication_date":"2017-06-30","ids":{"openalex":"https://openalex.org/W2963120624","doi":"https://doi.org/10.23638/lmcs-13(2:13)2017","mag":"2963120624"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(2:13)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(2:13)2017","pdf_url":"https://lmcs.episciences.org/3753/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/3753/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044883502","display_name":"Giorgio Bacci","orcid":"https://orcid.org/0000-0003-4004-6049"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Giorgio Bacci","raw_affiliation_strings":["Dept. of Computer Science , Aalborg University , Denmark","Aalborg Universitet","Dept. of Computer Science, Aalborg University, Denmark"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science , Aalborg University , Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Aalborg Universitet","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Dept. of Computer Science, Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016152088","display_name":"Giovanni Bacci","orcid":"https://orcid.org/0000-0001-8529-0681"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Giovanni Bacci","raw_affiliation_strings":["Dept. of Computer Science , Aalborg University , Denmark","Dept. of Computer Science, Aalborg University, Denmark","Aalborg Universitet"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science , Aalborg University , Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Dept. of Computer Science, Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Aalborg Universitet","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069362159","display_name":"Kim G. Larsen","orcid":"https://orcid.org/0000-0002-5953-3384"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kim G. Larsen","raw_affiliation_strings":["Dept. of Computer Science, Aalborg University, Denmark","Aalborg Universitet"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Aalborg Universitet","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060646027","display_name":"Radu Mardare","orcid":"https://orcid.org/0000-0001-8660-1832"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Radu Mardare","raw_affiliation_strings":["Dept. of Computer Science , Aalborg University , Denmark","Dept. of Computer Science, Aalborg University, Denmark","Aalborg Universitet"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science , Aalborg University , Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Dept. of Computer Science, Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]},{"raw_affiliation_string":"Aalborg Universitet","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044883502"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":0.2369,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62091837,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"Volume 13, Issue 2","issue":null,"first_page":null,"last_page":null},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9972000122070312,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9872999787330627,"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/markov-chain","display_name":"Markov chain","score":0.6304056644439697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5533890724182129},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5498917698860168},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5323073863983154},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5290830731391907},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.526354193687439},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47381582856178284},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.47155997157096863},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4658328890800476},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.4316380023956299},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.41140666604042053},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41048556566238403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35394486784935},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3240028917789459},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.28523993492126465}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6304056644439697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5533890724182129},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5498917698860168},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5323073863983154},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5290830731391907},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.526354193687439},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47381582856178284},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.47155997157096863},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4658328890800476},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.4316380023956299},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.41140666604042053},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41048556566238403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35394486784935},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3240028917789459},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28523993492126465},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.23638/lmcs-13(2:13)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(2:13)2017","pdf_url":"https://lmcs.episciences.org/3753/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1702.08306","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.08306","pdf_url":"https://arxiv.org/pdf/1702.08306","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/ba4b5bf6-c925-4c67-ad5b-f5d6229b3be6","is_oa":true,"landing_page_url":"https://vbn.aau.dk/da/publications/ba4b5bf6-c925-4c67-ad5b-f5d6229b3be6","pdf_url":"https://vbn.aau.dk/ws/files/267947282/OA_article.pdf","source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"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":"Bacci, G, Bacci, G, Larsen, K G & Mardare, R I 2017, 'On-the-Fly Computation of Bisimilarity Distances', Logical Methods in Computer Science, vol. 13, no. 2. https://doi.org/10.23638/LMCS-13(2:13)2017","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:20d51ffaea6a44a0b2ec2a6f0224455d","is_oa":true,"landing_page_url":"https://doaj.org/article/20d51ffaea6a44a0b2ec2a6f0224455d","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 13, Issue 2 (2017)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(2:13)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(2:13)2017","pdf_url":"https://lmcs.episciences.org/3753/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7913124052","display_name":null,"funder_award_id":"669844","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963120624.pdf","grobid_xml":"https://content.openalex.org/works/W2963120624.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W40177797","https://openalex.org/W176827812","https://openalex.org/W1515897776","https://openalex.org/W1526648666","https://openalex.org/W1545300203","https://openalex.org/W1585160083","https://openalex.org/W1591992921","https://openalex.org/W1963547452","https://openalex.org/W1976268573","https://openalex.org/W2010466545","https://openalex.org/W2015172530","https://openalex.org/W2017779181","https://openalex.org/W2026629052","https://openalex.org/W2061059823","https://openalex.org/W2076087052","https://openalex.org/W2108489993","https://openalex.org/W2125678250","https://openalex.org/W2157977984","https://openalex.org/W2201672140","https://openalex.org/W2518771331","https://openalex.org/W2914642483","https://openalex.org/W3099747567","https://openalex.org/W3105443234","https://openalex.org/W3113130260","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2807018115","https://openalex.org/W4388236136","https://openalex.org/W4200250224","https://openalex.org/W2606546905","https://openalex.org/W2285658092","https://openalex.org/W2482498454","https://openalex.org/W2947128950","https://openalex.org/W1996326480","https://openalex.org/W185460758","https://openalex.org/W2910134461"],"abstract_inverted_index":{"We":[0],"propose":[1,70,114,151],"a":[2,28,53,71,90,98,189,211],"distance":[3,39,79,112],"between":[4,44,165],"continuous-time":[5,82],"Markov":[6,46],"chains":[7,47],"(CTMCs)":[8],"and":[9,25,231],"study":[10],"the":[11,37,62,78,81,101,104,111,125,140,158,163,174,185,195,203,225,228],"problem":[12],"of":[13,40,52,92,103,143,173,184,214,227,237],"computing":[14],"it":[15],"by":[16,60,66,97,139,180],"comparing":[17],"three":[18],"different":[19],"algorithmic":[20],"methodologies:":[21],"iterative,":[22],"linear":[23,54,73,127,232],"program,":[24],"on-the-fly.":[26],"In":[27],"work":[29,146],"presented":[30,147],"at":[31,148],"FoSSaCS'12,":[32],"Chen":[33],"et":[34,42],"al.":[35,43],"characterized":[36],"bisimilarity":[38],"Desharnais":[41],"discrete-time":[45],"as":[48],"an":[49,152,170],"optimal":[50],"solution":[51],"program":[55,74,128,233],"that":[56,94,110,194,219],"can":[57,115],"be":[58,116,133],"solved":[59],"using":[61,188],"ellipsoid":[63],"method.":[64],"Inspired":[65],"their":[67],"result,":[68],"we":[69,113,150],"novel":[72],"characterization":[75,129],"to":[76,132],"compute":[77],"in":[80,100,107,118,135],"setting.":[83],"Differently":[84],"from":[85],"previous":[86,145],"proposals,":[87],"ours":[88],"has":[89],"number":[91],"constraints":[93],"is":[95,198],"bounded":[96],"polynomial":[99,119],"size":[102],"CTMC.":[105],"This,":[106],"particular,":[108],"proves":[109],"computed":[117],"time.":[120],"Despite":[121],"its":[122],"theoretical":[123],"importance,":[124],"proposed":[126],"turns":[130],"out":[131],"inefficient":[134],"practice.":[136],"Nevertheless,":[137],"driven":[138],"encouraging":[141],"results":[142],"our":[144,220],"TACAS'13,":[149],"efficient":[153],"on-the-fly":[154],"algorithm,":[155],"which,":[156],"unlike":[157],"other":[159],"mentioned":[160],"solutions,":[161],"computes":[162],"distances":[164,187],"two":[166],"given":[167],"states":[168],"avoiding":[169],"exhaustive":[171],"exploration":[172],"state":[175,196],"space.":[176],"This":[177],"technique":[178],"works":[179],"successively":[181],"refining":[182],"over-approximations":[183],"target":[186],"greedy":[190],"strategy,":[191],"which":[192],"ensures":[193],"space":[197],"further":[199],"explored":[200],"only":[201],"when":[202],"current":[204],"approximations":[205],"are":[206],"improved.":[207],"Tests":[208],"performed":[209],"on":[210,223],"consistent":[212],"set":[213],"(pseudo)randomly":[215],"generated":[216],"CTMCs":[217],"show":[218],"algorithm":[221],"improves,":[222],"average,":[224],"efficiency":[226],"corresponding":[229],"iterative":[230],"methods":[234],"with":[235],"orders":[236],"magnitude.":[238]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}