{"id":"https://openalex.org/W4232474943","doi":"https://doi.org/10.1109/lics.2004.1319596","title":"Model checking probabilistic pushdown automata","display_name":"Model checking probabilistic pushdown automata","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4232474943","doi":"https://doi.org/10.1109/lics.2004.1319596"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2004.1319596","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319596","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-article"},"type":"article","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/A5090378914","display_name":"Javier Esparza","orcid":"https://orcid.org/0000-0001-9862-4919"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"J. Esparza","raw_affiliation_strings":["Institute for Formal Methods in Computer Science, University of Stuttgart, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Methods in Computer Science, University of Stuttgart, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","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/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]},{"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","DE"],"is_corresponding":false,"raw_author_name":"A. Kucera","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Brno, Czech Republic","Institute for Formal Methods in Computer Science, University of Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"Institute for Formal Methods in Computer Science, University of Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"R. Mayr","raw_affiliation_strings":["Department of Computer Science, Albert Ludwigs University of Freiburg, Freiburg im Breisgau, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Albert Ludwigs University of Freiburg, Freiburg im Breisgau, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090378914"],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":8.0922,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.9806426,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"12","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9930999875068665,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9904000163078308,"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/decidability","display_name":"Decidability","score":0.8299721479415894},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7105553150177002},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.632439136505127},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6260205507278442},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6020793914794922},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5315584540367126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5088377594947815},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44355663657188416},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.4233844578266144},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4221349358558655},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3899902105331421},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.351158082485199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32164040207862854},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.1946859359741211},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07754328846931458}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8299721479415894},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7105553150177002},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.632439136505127},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6260205507278442},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6020793914794922},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5315584540367126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5088377594947815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44355663657188416},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.4233844578266144},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4221349358558655},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3899902105331421},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.351158082485199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32164040207862854},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.1946859359741211},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07754328846931458},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2004.1319596","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319596","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1491036809","https://openalex.org/W1497670448","https://openalex.org/W1511105469","https://openalex.org/W1555229756","https://openalex.org/W1561838634","https://openalex.org/W1590891429","https://openalex.org/W1903527352","https://openalex.org/W1930640507","https://openalex.org/W1944241544","https://openalex.org/W1972203711","https://openalex.org/W2002663600","https://openalex.org/W2005998857","https://openalex.org/W2069979244","https://openalex.org/W2102074804","https://openalex.org/W2107771181","https://openalex.org/W2114132089","https://openalex.org/W2138695497","https://openalex.org/W2153983552","https://openalex.org/W2158487182","https://openalex.org/W2165161585","https://openalex.org/W2168605507","https://openalex.org/W3022006420","https://openalex.org/W4232474943","https://openalex.org/W4244719572","https://openalex.org/W4298290503","https://openalex.org/W6629167681","https://openalex.org/W6633187783","https://openalex.org/W6640661543","https://openalex.org/W6674719972","https://openalex.org/W6682069976"],"related_works":["https://openalex.org/W2039777175","https://openalex.org/W1537446812","https://openalex.org/W1541953080","https://openalex.org/W1589224558","https://openalex.org/W2103587987","https://openalex.org/W2182165215","https://openalex.org/W2266924268","https://openalex.org/W2036539537","https://openalex.org/W4294226097","https://openalex.org/W428839547"],"abstract_inverted_index":{"We":[0,18,34],"consider":[1,90],"the":[2,59,63,83,91],"model":[3,41,56,76,107],"checking":[4,42,57,77,108],"problem":[5],"for":[6,43,58,79,109],"probabilistic":[7,16],"pushdown":[8],"automata":[9],"(pPDA)":[10],"and":[11,39,48,66,82,100,105],"properties":[12,21,47,94],"expressible":[13],"in":[14],"various":[15],"logics.":[17],"start":[19],"with":[20],"that":[22,36,55,102],"can":[23],"be":[24],"formulated":[25],"as":[26],"instances":[27],"of":[28,46,62,85,93],"a":[29],"generalized":[30],"random":[31],"walk":[32],"problem.":[33],"prove":[35],"both":[37,103],"qualitative":[38,60,104],"quantitative":[40,106],"this":[44],"class":[45,92],"pPDA":[49,67,110],"is":[50,68,111],"decidable.":[51,70,112],"Then,":[52],"we":[53,72,89],"show":[54,101],"fragment":[61],"logic":[64],"PCTL":[65,81],"also":[69],"Moreover,":[71],"develop":[73],"an":[74],"error-tolerant":[75],"algorithm":[78],"general":[80],"subclass":[84],"stateless":[86],"pPDA.":[87],"Finally,":[88],"definable":[95],"by":[96],"deterministic":[97],"Buchi":[98],"automata,":[99]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}