{"id":"https://openalex.org/W1506542859","doi":"https://doi.org/10.1007/11817949_24","title":"Reachability in Recursive Markov Decision Processes","display_name":"Reachability in Recursive Markov Decision Processes","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1506542859","doi":"https://doi.org/10.1007/11817949_24","mag":"1506542859"},"language":"en","primary_location":{"id":"doi:10.1007/11817949_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11817949_24","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5082160514","display_name":"Tom\u01ce\u0161 Br\u00e1zdil","orcid":"https://orcid.org/0000-0002-4547-3261"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Tom\u00e1\u0161 Br\u00e1zdil","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072079710","display_name":"V\u00e1clav Bro\u017eek","orcid":null},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"V\u00e1clav Bro\u017eek","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087974593","display_name":"Vojt\u011bch Forejt","orcid":"https://orcid.org/0000-0002-4065-7299"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vojt\u011bch Forejt","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019575165","display_name":"Anton\u0131\u0301n Ku\u010dera","orcid":"https://orcid.org/0000-0002-6602-8028"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Anton\u00edn Ku\u010dera","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5082160514"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.4992,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.87693857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"358","last_page":"374"},"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.994700014591217,"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":0.9837999939918518,"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/reachability","display_name":"Reachability","score":0.8901498913764954},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.70716792345047},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.596927285194397},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.593475341796875},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.4631378650665283},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.461463987827301},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4587135910987854},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4401710331439972},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.440043181180954},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.43828245997428894},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43615150451660156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40058082342147827},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3975345194339752},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.28024399280548096},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23938912153244019},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.20684006810188293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19934439659118652}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8901498913764954},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.70716792345047},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.596927285194397},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.593475341796875},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.4631378650665283},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.461463987827301},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4587135910987854},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4401710331439972},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.440043181180954},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.43828245997428894},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43615150451660156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40058082342147827},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3975345194339752},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.28024399280548096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23938912153244019},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.20684006810188293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19934439659118652},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11817949_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11817949_24","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1482647296","https://openalex.org/W1498910922","https://openalex.org/W1589224558","https://openalex.org/W1601373402","https://openalex.org/W1859458367","https://openalex.org/W1864873123","https://openalex.org/W2005998857","https://openalex.org/W2051580064","https://openalex.org/W2114132089","https://openalex.org/W2167246417","https://openalex.org/W2334782222","https://openalex.org/W2751862591","https://openalex.org/W4242441073","https://openalex.org/W6606507440"],"related_works":["https://openalex.org/W2961758588","https://openalex.org/W2506850889","https://openalex.org/W2020140696","https://openalex.org/W2396103282","https://openalex.org/W2584984136","https://openalex.org/W2935928249","https://openalex.org/W2591956186","https://openalex.org/W2090401819","https://openalex.org/W2489809986","https://openalex.org/W3024140877"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}