{"id":"https://openalex.org/W2101251694","doi":"https://doi.org/10.2168/lmcs-2(1:2)2006","title":"Model Checking Probabilistic Pushdown Automata","display_name":"Model Checking Probabilistic Pushdown Automata","publication_year":2006,"publication_date":"2006-03-07","ids":{"openalex":"https://openalex.org/W2101251694","doi":"https://doi.org/10.2168/lmcs-2(1:2)2006","mag":"2101251694"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-2(1:2)2006","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-2(1:2)2006","pdf_url":"https://lmcs.episciences.org/2256/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2256/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"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":false,"raw_author_name":"Javier Esparza","raw_affiliation_strings":["Institute for Formal Methods in Computer Science, University of Stuttgart, Universittsstr. 38, 70569 Stuttgart, Germany"],"raw_orcid":"https://orcid.org/0000-0001-9862-4919","affiliations":[{"raw_affiliation_string":"Institute for Formal Methods in Computer Science, University of Stuttgart, Universittsstr. 38, 70569 Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Antonin Kucera","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Antonin Kucera","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Richard Mayr","orcid":null},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Mayr","raw_affiliation_strings":["Department of Computer Science, North Carolina State University, 900 Main Campus Drive, Campus Box 8207, Raleigh NC 27695, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, North Carolina State University, 900 Main Campus Drive, Campus Box 8207, Raleigh NC 27695, USA","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6637,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":{"value":0.84233748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"Volume 2, Issue 1","issue":null,"first_page":null,"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.9613999724388123,"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.9613999724388123,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.016300000250339508,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.003700000001117587,"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/model-checking","display_name":"Model checking","score":0.7562999725341797},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.620199978351593},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.6122000217437744},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.5952000021934509},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5929999947547913},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4587000012397766},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.41780000925064087},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.4007999897003174}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7562999725341797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6273000240325928},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.620199978351593},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.6122000217437744},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.5952000021934509},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5929999947547913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5530999898910522},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4587000012397766},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.41780000925064087},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.4007999897003174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3944999873638153},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3935999870300293},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.37630000710487366},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.3725999891757965},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35010001063346863},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.34150001406669617},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3043999969959259},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.2809999883174896},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.26179999113082886}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.2168/lmcs-2(1:2)2006","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-2(1:2)2006","pdf_url":"https://lmcs.episciences.org/2256/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/d4325bd1-18cb-41a6-b566-eb070df59029","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d4325bd1-18cb-41a6-b566-eb070df59029","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kucera, A, Esparza, J & Mayr, R 2006, 'Model Checking Probabilistic Pushdown Automata', Logical Methods in Computer Science, vol. 2, no. 1. https://doi.org/10.2168/LMCS-2(1:2)2006","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:cs/0508003","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0508003","pdf_url":"https://arxiv.org/pdf/cs/0508003","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/d4325bd1-18cb-41a6-b566-eb070df59029","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/d4325bd1-18cb-41a6-b566-eb070df59029","pdf_url":"https://www.pure.ed.ac.uk/ws/files/17904309/Esparza_Kucera_ET_AL_2006_Model_Checking_Probabilistic_Pushdown_Automata.pdf","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Kucera, A, Esparza, J & Mayr, R 2006, 'Model Checking Probabilistic Pushdown Automata', Logical Methods in Computer Science, vol. 2, no. 1. https://doi.org/10.2168/LMCS-2(1:2)2006","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:99fcb38f05994be8ae681c0d1a8ee17a","is_oa":true,"landing_page_url":"https://doaj.org/article/99fcb38f05994be8ae681c0d1a8ee17a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 2, Issue 1 (2006)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-2(1:2)2006","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-2(1:2)2006","pdf_url":"https://lmcs.episciences.org/2256/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308269","display_name":"Alexander von Humboldt-Stiftung","ror":"https://ror.org/012kf4317"},{"id":"https://openalex.org/F4320310414","display_name":"Baden-W\u00fcrttemberg Stiftung","ror":"https://ror.org/031h5fa94"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320325850","display_name":"Universit\u00e4t Stuttgart","ror":"https://ror.org/04vnq7t77"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2101251694.pdf","grobid_xml":"https://content.openalex.org/works/W2101251694.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1491036809","https://openalex.org/W1497670448","https://openalex.org/W1504187169","https://openalex.org/W1511105469","https://openalex.org/W1555229756","https://openalex.org/W1561838634","https://openalex.org/W1569859040","https://openalex.org/W1589224558","https://openalex.org/W1590891429","https://openalex.org/W1715173658","https://openalex.org/W1864873123","https://openalex.org/W1903527352","https://openalex.org/W1972203711","https://openalex.org/W2002663600","https://openalex.org/W2005998857","https://openalex.org/W2067754486","https://openalex.org/W2069979244","https://openalex.org/W2102074804","https://openalex.org/W2107771181","https://openalex.org/W2114132089","https://openalex.org/W2138695497","https://openalex.org/W2148265818","https://openalex.org/W2153983552","https://openalex.org/W2158487182","https://openalex.org/W2159247347","https://openalex.org/W2165161585","https://openalex.org/W2168605507","https://openalex.org/W2751862591","https://openalex.org/W3022006420","https://openalex.org/W4232474943","https://openalex.org/W4244719572","https://openalex.org/W4298290503"],"related_works":[],"abstract_inverted_index":{"We":[0,18,34],"consider":[1,89],"the":[2,59,63,82,90],"model":[3,41,56,76,102],"checking":[4,42,57,77,103],"problem":[5],"for":[6,43,58,79,104],"probabilistic":[7,16],"pushdown":[8],"automata":[9],"(pPDA)":[10],"and":[11,39,48,66,81,95,100],"properties":[12,21,47,94],"expressible":[13],"in":[14],"various":[15],"logics.":[17],"start":[19],"with":[20],"that":[22,36,55,97],"can":[23],"be":[24],"formulated":[25],"as":[26],"instances":[27],"of":[28,46,62,84,92],"a":[29],"generalized":[30],"random":[31],"walk":[32],"problem.":[33],"prove":[35],"both":[37,98],"qualitative":[38,60,99],"quantitative":[40,101],"this":[44],"class":[45,91],"pPDA":[49,67,105],"is":[50,68,106],"decidable.":[51,70,107],"Then":[52],"we":[53,72,88],"show":[54,96],"fragment":[61],"logic":[64],"PCTL":[65,80],"also":[69],"Moreover,":[71],"develop":[73],"an":[74],"error-tolerant":[75],"algorithm":[78],"subclass":[83],"stateless":[85],"pPDA.":[86],"Finally,":[87],"omega-regular":[93]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2016-06-24T00:00:00"}