{"id":"https://openalex.org/W1949868634","doi":"https://doi.org/10.1109/lics.2003.1210074","title":"Labeled Markov processes: stronger and faster approximations","display_name":"Labeled Markov processes: stronger and faster approximations","publication_year":2003,"publication_date":"2003-12-22","ids":{"openalex":"https://openalex.org/W1949868634","doi":"https://doi.org/10.1109/lics.2003.1210074","mag":"1949868634"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2003.1210074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2003.1210074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111482850","display_name":"Vincent Danos","orcid":null},"institutions":[{"id":"https://openalex.org/I4210139011","display_name":"Laboratory Preuves, Programmes et Syst\u00e8mes","ror":"https://ror.org/046p9e825","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I204730241","https://openalex.org/I4210139011","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"V. Danos","raw_affiliation_strings":["PPS, CNRS and Universit\u00e9 Paris 7, Paris, France","Preuves, Programmes et Syst\u00e8mes"],"affiliations":[{"raw_affiliation_string":"PPS, CNRS and Universit\u00e9 Paris 7, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Preuves, Programmes et Syst\u00e8mes","institution_ids":["https://openalex.org/I4210139011"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000109637","display_name":"Jos\u00e9e Desharnais","orcid":"https://orcid.org/0000-0003-2410-3314"},"institutions":[{"id":"https://openalex.org/I43406934","display_name":"Universit\u00e9 Laval","ror":"https://ror.org/04sjchr03","country_code":"CA","type":"education","lineage":["https://openalex.org/I43406934"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Desharnais","raw_affiliation_strings":["D\u00e9partement dinformatique et de g\u00e9nie logiciel, Universit\u00e9 Laval, QUE, Canada","Universit\u00e9 Laval [Qu\u00e9bec]"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement dinformatique et de g\u00e9nie logiciel, Universit\u00e9 Laval, QUE, Canada","institution_ids":["https://openalex.org/I43406934"]},{"raw_affiliation_string":"Universit\u00e9 Laval [Qu\u00e9bec]","institution_ids":["https://openalex.org/I43406934"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111482850"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210139011"],"apc_list":null,"apc_paid":null,"fwci":2.1821,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.86919629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"341","last_page":"350"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9940000176429749,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/measure","display_name":"Measure (data warehouse)","score":0.6477046608924866},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5917575359344482},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5623588562011719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5305768847465515},{"id":"https://openalex.org/keywords/quotient","display_name":"Quotient","score":0.4942893981933594},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4895506799221039},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4829258620738983},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4658340811729431},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.45012804865837097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44491827487945557},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4398103356361389},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43174517154693604},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.40136492252349854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39119651913642883},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3702772259712219},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1866658627986908},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.14160552620887756},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10799115896224976}],"concepts":[{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.6477046608924866},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5917575359344482},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5623588562011719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5305768847465515},{"id":"https://openalex.org/C199422724","wikidata":"https://www.wikidata.org/wiki/Q41118","display_name":"Quotient","level":2,"score":0.4942893981933594},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4895506799221039},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4829258620738983},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4658340811729431},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.45012804865837097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44491827487945557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4398103356361389},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43174517154693604},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.40136492252349854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39119651913642883},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3702772259712219},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1866658627986908},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.14160552620887756},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10799115896224976},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/lics.2003.1210074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2003.1210074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.104.2711","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.2711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.pps.jussieu.fr/~danos/pdf/troisapprox.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.6747","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.6747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.mcgill.ca/~prakash/Pubs/troisapprox.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00164588v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00164588","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003, Canada. pp.341-350","raw_type":"Conference papers"},{"id":"pmh:oai:HAL:hal-00164589v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00164589","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Notes in Theoretical Computer Science, 2004, 87, pp.157-203","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W41021295","https://openalex.org/W1224113374","https://openalex.org/W1488856606","https://openalex.org/W1504009014","https://openalex.org/W1540519426","https://openalex.org/W1571174323","https://openalex.org/W1602844557","https://openalex.org/W1605626978","https://openalex.org/W1698217787","https://openalex.org/W1973795188","https://openalex.org/W1978469611","https://openalex.org/W2013672985","https://openalex.org/W2033810643","https://openalex.org/W2053662828","https://openalex.org/W2100893927","https://openalex.org/W2108670836","https://openalex.org/W2115154197","https://openalex.org/W2152692559","https://openalex.org/W2155748644","https://openalex.org/W4230058301","https://openalex.org/W4285719527","https://openalex.org/W4301524229","https://openalex.org/W6601643350"],"related_works":["https://openalex.org/W1551070491","https://openalex.org/W2034301573","https://openalex.org/W2103740034","https://openalex.org/W2350953867","https://openalex.org/W1592102986","https://openalex.org/W2166027622","https://openalex.org/W2612218842","https://openalex.org/W1513903619","https://openalex.org/W2030935018","https://openalex.org/W2203774400"],"abstract_inverted_index":{"This":[0,32],"paper":[1],"proposes":[2],"a":[3,29,78],"measure-theoretic":[4,68],"reconstruction":[5],"of":[6,24,36,43,91],"the":[7,34],"approximation":[8],"schemes":[9],"developed":[10],"for":[11,56,63],"labeled":[12],"Markov":[13],"processes:":[14],"approximants":[15,38,86],"are":[16],"seen":[17],"as":[18],"quotients":[19],"with":[20,39,72,77],"respect":[21,40],"to":[22,41,84],"sets":[23],"temporal":[25],"properties":[26,42,90],"expressed":[27],"in":[28],"simple":[30],"logic.":[31],"gives":[33,82],"possibility":[35],"customizing":[37],"interest":[44],"and":[45,81],"is":[46],"thus":[47],"an":[48,73],"important":[49],"step":[50],"towards":[51],"using":[52],"automated":[53],"techniques":[54],"intended":[55],"finite":[57],"state":[58,65],"systems,":[59],"e.g.":[60],"model":[61],"checking,":[62],"continuous":[64],"systems.":[66],"The":[67],"apparatus":[69],"meshes":[70],"well":[71],"enriched":[74],"logic,":[75],"extended":[76],"greatest":[79],"fix-point,":[80],"means":[83],"define":[85],"which":[87],"retain":[88],"cyclic":[89],"their":[92],"target.":[93]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}