{"id":"https://openalex.org/W32614697","doi":null,"title":"Model Checking by Censoring Markov Chains and Stochastic Comparison","display_name":"Model Checking by Censoring Markov Chains and Stochastic Comparison","publication_year":2009,"publication_date":"2009-05-14","ids":{"openalex":"https://openalex.org/W32614697","mag":"32614697"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.366.7336","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.7336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.archives-ouvertes.fr/docs/00/38/06/67/PDF/FormalAnalysis_2.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W32614697"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00380667","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109464011","display_name":"Nihal Pekergin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4394709117","display_name":"Laboratoire d'Algorithmique, Complexit\u00e9 et Logique","ror":"https://ror.org/05bdn0q71","country_code":"FR","type":"facility","lineage":["https://openalex.org/I197681013","https://openalex.org/I2800365227","https://openalex.org/I4394709117"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nihal Pekergin","raw_affiliation_strings":["LACL - Laboratoire d'Algorithmique Complexit\u00e9 et Logique (D\u00e9p.d'informatique Bat.P2 61,avenue du g\u00e9n\u00e9ral de Gaulle 94010 CRETEIL CEDEX - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LACL - Laboratoire d'Algorithmique Complexit\u00e9 et Logique (D\u00e9p.d'informatique Bat.P2 61,avenue du g\u00e9n\u00e9ral de Gaulle 94010 CRETEIL CEDEX - France)","institution_ids":["https://openalex.org/I4394709117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058665137","display_name":"Sana Youn\u00e8s","orcid":"https://orcid.org/0000-0002-4883-3381","observed_orcids":["https://orcid.org/0000-0002-4883-3381"]},"institutions":[{"id":"https://openalex.org/I195731000","display_name":"Universit\u00e9 de Versailles Saint-Quentin-en-Yvelines","ror":"https://ror.org/03mkjjy25","country_code":"FR","type":"education","lineage":["https://openalex.org/I195731000","https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sana Youn\u00e8s","raw_affiliation_strings":["PRISM - Parall\u00e9lisme, R\u00e9seaux, Syst\u00e8mes, Mod\u00e9lisation (UFR des sciences PRISM \r\n B\u00e2timent Descartes \r\n45 avenue des Etats-Unis\r\n78035 VERSAILLES - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PRISM - Parall\u00e9lisme, R\u00e9seaux, Syst\u00e8mes, Mod\u00e9lisation (UFR des sciences PRISM \r\n B\u00e2timent Descartes \r\n45 avenue des Etats-Unis\r\n78035 VERSAILLES - France)","institution_ids":["https://openalex.org/I195731000"]}]}],"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.00356178,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"7 pages","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.9990000128746033,"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.9990000128746033,"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.00039999998989515007,"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/T10126","display_name":"Logic, programming, and type systems","score":9.999999747378752e-05,"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/model-checking","display_name":"model checking","score":0.996999979019165},{"id":"https://openalex.org/keywords/discrete-time-markov-chains","display_name":"discrete-time Markov chains","score":0.8840000033378601},{"id":"https://openalex.org/keywords/bounding-methods","display_name":"bounding methods","score":0.5649999976158142},{"id":"https://openalex.org/keywords/probabilistic-verification","display_name":"probabilistic verification","score":0.5789999961853027}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8478323221206665},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7658694982528687},{"id":"https://openalex.org/C137668524","wikidata":"https://www.wikidata.org/wiki/Q189813","display_name":"Censoring (clinical trials)","level":2,"score":0.7041734457015991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6567649245262146},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5745887160301208},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48585984110832214},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.46646344661712646},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46016475558280945},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.4455571174621582},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.413464218378067},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.41020333766937256},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3575386106967926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3221922516822815},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11292469501495361},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10415646433830261},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09632384777069092},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.366.7336","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.7336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.archives-ouvertes.fr/docs/00/38/06/67/PDF/FormalAnalysis_2.pdf","raw_type":"text"},{"id":"mag:32614697","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-00380667","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"HAL (Le Centre pour la Communication Scientifique Directe)","raw_type":null},{"id":"pmh:oai:HAL:hal-00380667v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-00380667","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"12th European Workshop on Dependable Computing, EWDC 2009, May 2009, Toulouse, France. 7 p","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"mag:32614697","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-00380667","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"HAL (Le Centre pour la Communication Scientifique Directe)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320337351","display_name":"National Cancer Institute","ror":"https://ror.org/040gcmg81"},{"id":"https://openalex.org/F4320337354","display_name":"National Institute of General Medical Sciences","ror":"https://ror.org/04q48ey07"},{"id":"https://openalex.org/F4320337357","display_name":"National Institute of Diabetes and Digestive and Kidney Diseases","ror":"https://ror.org/00adh9b73"},{"id":"https://openalex.org/F4320337359","display_name":"National Institute of Neurological Disorders and Stroke","ror":"https://ror.org/01s5ya894"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1492462065","https://openalex.org/W1508957056","https://openalex.org/W1973013714","https://openalex.org/W1991534723","https://openalex.org/W1992580876","https://openalex.org/W2005998857","https://openalex.org/W2041226400","https://openalex.org/W2042624802","https://openalex.org/W2098395449","https://openalex.org/W2107224406","https://openalex.org/W2117189826","https://openalex.org/W2118132438","https://openalex.org/W2165208635","https://openalex.org/W2326063613","https://openalex.org/W2740072664"],"related_works":["https://openalex.org/W6987328557","https://openalex.org/W7099572757","https://openalex.org/W1492462065","https://openalex.org/W2144502731","https://openalex.org/W2097403647","https://openalex.org/W2137369624","https://openalex.org/W55365985","https://openalex.org/W2312234445","https://openalex.org/W2737154839","https://openalex.org/W1488390270"],"abstract_inverted_index":{"Abstract":[0],"\u2014":[1],"We":[2],"study":[3],"how":[4],"to":[5,18,29,39,42,100],"combine":[6],"the":[7,14,31,34,54,62,78,81,87,90,93,102,105,109,114],"censoring":[8],"technique":[9],"for":[10,86],"Markov":[11,24],"chains":[12],"and":[13],"strong":[15],"stochastic":[16],"comparison":[17],"perform":[19],"model":[20,35,48],"checking":[21,36,49],"of":[22,33,89,104,121],"discrete-time":[23],"chains.":[25],"Our":[26],"goal":[27],"is":[28,97],"reduce":[30],"complexity":[32],"in":[37,74],"order":[38],"be":[40],"able":[41],"consider":[43],"numerically":[44],"intractable":[45],"models.":[46],"In":[47,92],"we":[50,58,83,111],"do":[51],"not":[52,98],"need":[53],"exact":[55],"values":[56],"but":[57],"must":[59],"decide":[60,85,101],"if":[61,77],"required":[63],"guarantees":[64],"are":[65,72],"satisfied":[66],"or":[67],"not.":[68],"Thus":[69],"bounding":[70],"methods":[71],"suitable":[73],"this":[75],"context:":[76],"bounds":[79,115],"meet":[80],"threshold":[82],"can":[84,112],"satisfaction":[88,103],"formula.":[91],"case":[94],"when":[95],"it":[96],"possible":[99],"underlying":[106],"formula":[107],"through":[108],"bounds,":[110],"refine":[113],"by":[116],"considering":[117],"a":[118],"larger":[119],"set":[120],"states.":[122],"I.":[123]},"counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}