{"doi":"10.1109/9.720497","title":"Markov decision processes and regular events","abstract":null,"journal":"IEEE Transactions on Automatic Control","year":1998,"id":29335,"datarank":4.324018306861087,"base_score":3.9889840465642745,"endowment":3.9889840465642745,"self_citation_contribution":0.5983476069846413,"citation_network_contribution":3.7256706998764457,"self_endowment_contribution":0.5983476069846413,"citer_contribution":3.7256706998764457,"corpus_percentile":null,"corpus_rank":null,"citation_count":53,"citer_count":43,"citers_with_citation_signal":40,"citers_with_endowment":40,"datacite_reuse_total":1,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":161971,"name":"M. Yannakakis","orcid":null,"position":1,"is_corresponding":false},{"id":161970,"name":"C. Courcoubetis","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":3.9889840465642745,"endowment":3.9889840465642745,"datacite_reuse_total":1,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W4255368532","authors":[],"funders":[],"total_grants":0,"fwci":0.4909,"citation_percentile":0.71178037,"influential_citations":16,"citation_trend":[{"year":2012,"count":4},{"year":2013,"count":5},{"year":2014,"count":2},{"year":2015,"count":3},{"year":2016,"count":4},{"year":2017,"count":1},{"year":2019,"count":1},{"year":2020,"count":1},{"year":2021,"count":2},{"year":2023,"count":3}],"oa_status":"closed","license":"https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html","oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx4/9/15553/00720497.pdf?arnumber=720497","host_type":"publisher"},{"url":"https://doi.org/10.1109/9.720497","host_type":"journal"}],"fields_of_study":["Petri Nets in System Modeling","Formal Methods in Verification","Flexible and Reconfigurable Manufacturing Systems","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Markov decision process","Markov process","Finite state","Markov chain","Partially observable Markov decision process","Computer science","Mathematical optimization","Process (computing)","Markov kernel","Decision process","Mathematics","Markov model","Markov renewal process","Applied mathematics","Markov property","Variable-order Markov model","Machine learning","Management science","Statistics","Engineering"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Peace, Justice and strong institutions"}],"linked_datasets":[{"doi":"10.4230/lipics.fsttcs.2023.1","title":"Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk)","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T23:24:09.093526Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}