{"id":"https://openalex.org/W2083770991","doi":"https://doi.org/10.1142/s0129054108005814","title":"EQUIVALENCE OF LABELED MARKOV CHAINS","display_name":"EQUIVALENCE OF LABELED MARKOV CHAINS","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2083770991","doi":"https://doi.org/10.1142/s0129054108005814","mag":"2083770991"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054108005814","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054108005814","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/160918","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102787606","display_name":"Laurent Doyen","orcid":"https://orcid.org/0000-0003-3714-6145"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"LAURENT DOYEN","raw_affiliation_strings":["I&C, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), 1015 Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"I&C, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), 1015 Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080555605","display_name":"Thomas A. Henzinger","orcid":"https://orcid.org/0000-0002-2985-7724"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"THOMAS A. HENZINGER","raw_affiliation_strings":["I&C, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), EECS, University of California at Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"I&C, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), EECS, University of California at Berkeley, USA","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050196522","display_name":"Jean-Fran\u00e7ois Raskin","orcid":"https://orcid.org/0000-0002-3673-1097"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"JEAN-FRAN\u00c7OIS RASKIN","raw_affiliation_strings":["DI, Universit\u00e9 Libre de Bruxelles (ULB), Boulevard du Triomphe CP 212, 1050 Bruxelles, Belgium"],"affiliations":[{"raw_affiliation_string":"DI, Universit\u00e9 Libre de Bruxelles (ULB), Boulevard du Triomphe CP 212, 1050 Bruxelles, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102787606"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":3.7216,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.9293152,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":"03","first_page":"549","last_page":"563"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.9979000091552734,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7908715605735779},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7560690641403198},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6289348006248474},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5796183943748474},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.516337513923645},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.5156187415122986},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5104678869247437},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5009708404541016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49569618701934814},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42760422825813293},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41563063859939575},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4118981957435608},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3820889890193939},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34806281328201294},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3266140818595886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30414867401123047}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7908715605735779},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7560690641403198},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6289348006248474},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5796183943748474},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.516337513923645},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.5156187415122986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5104678869247437},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5009708404541016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49569618701934814},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42760422825813293},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41563063859939575},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4118981957435608},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3820889890193939},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34806281328201294},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3266140818595886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30414867401123047},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1142/s0129054108005814","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054108005814","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/67570","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/67570","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International journal of foundations of computer science, 19 (3","raw_type":"info:ulb-repo/semantics/openurl/article"},{"id":"pmh:oai:infoscience.tind.io:160918","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/160918","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/160918","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.tind.io:160918","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/160918","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infoscience.epfl.ch/record/160918","raw_type":"Text"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W177913229","https://openalex.org/W1579183220","https://openalex.org/W1976268573","https://openalex.org/W1984151763","https://openalex.org/W2027671360","https://openalex.org/W2122092249","https://openalex.org/W4212875940","https://openalex.org/W4237537402","https://openalex.org/W4248402004"],"related_works":["https://openalex.org/W1704074244","https://openalex.org/W2113256684","https://openalex.org/W2107608134","https://openalex.org/W2136485937","https://openalex.org/W1554045856","https://openalex.org/W1598641851","https://openalex.org/W1965551437","https://openalex.org/W1601172863","https://openalex.org/W2618109676","https://openalex.org/W2963754540"],"abstract_inverted_index":{"We":[0,38,67,89,157],"consider":[1,104],"the":[2,29,35,52,74,92,96,105,127,133,140,145,160],"equivalence":[3,41,53,75,97,106],"problem":[4,54,107,154],"for":[5,55,86,108,120,130,139],"labeled":[6,14,109],"Markov":[7,110],"chains":[8],"(LMCs),":[9],"where":[10],"each":[11,131],"state":[12],"is":[13,59,78],"with":[15],"an":[16,69],"observation.":[17],"Two":[18],"LMCs":[19,147],"are":[20,148],"equivalent":[21],"if":[22],"every":[23,121],"finite":[24],"sequence":[25],"of":[26,32,84,98,125,132,152],"observations":[27],"has":[28],"same":[30],"probability":[31],"occurrence":[33],"in":[34,45,64],"two":[36,117],"LMCs.":[37],"show":[39,158],"that":[40,144,159],"can":[42,162],"be":[43,62,163,166],"decided":[44],"polynomial":[46,65],"time,":[47],"using":[48],"a":[49,81,137],"reduction":[50],"to":[51,61,72,94,165],"probabilistic":[56,87,100],"automata,":[57],"which":[58,77,114],"known":[60],"solvable":[63],"time.":[66],"provide":[68],"alternative":[70],"algorithm":[71],"solve":[73],"problem,":[76],"based":[79],"on":[80],"new":[82],"definition":[83],"bisimulation":[85],"automata.":[88,101],"also":[90],"extend":[91],"technique":[93],"decide":[95],"weighted":[99],"Then,":[102],"we":[103],"decision":[111],"processes":[112],"(LMDPs),":[113],"asks":[115],"given":[116],"LMDPs":[118],"whether":[119],"scheduler":[122,138],"(i.e.":[123],"way":[124],"resolving":[126],"nondeterministic":[128],"decisions)":[129],"processes,":[134],"there":[135],"exists":[136],"other":[141],"process":[142],"such":[143],"resulting":[146],"equivalent.":[149],"The":[150],"decidability":[151],"this":[153],"remains":[155],"open.":[156],"schedulers":[161],"restricted":[164],"observation-based,":[167],"but":[168],"may":[169],"require":[170],"infinite":[171],"memory.":[172]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}