{"id":"https://openalex.org/W2610458644","doi":null,"title":"Verification of Probabilistic Recursive Sequential Programs","display_name":"Verification of Probabilistic Recursive Sequential Programs","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2610458644","mag":"2610458644"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.192.4112","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.4112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.fi.muni.cz/%7Exbrazdil/thesis.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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","observed_orcids":["https://orcid.org/0000-0002-4547-3261"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tom\u01ce\u0161 Br\u00e1zdil","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4547-3261","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5082160514"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2821,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.88269502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"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.9883000254631042,"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.9883000254631042,"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/T11567","display_name":"semigroups and automata theory","score":0.0052999998442828655,"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.003000000026077032,"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/probabilistic-pushdown-automata","display_name":"probabilistic pushdown automata","score":0.9919999837875366},{"id":"https://openalex.org/keywords/infinite-state-systems","display_name":"infinite-state systems","score":0.7789999842643738},{"id":"https://openalex.org/keywords/decidability","display_name":"decidability","score":0.7480000257492065},{"id":"https://openalex.org/keywords/complexity","display_name":"complexity","score":0.48500001430511475},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"temporal logic","score":0.6620000004768372},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"linear temporal logic","score":0.9800000190734863},{"id":"https://openalex.org/keywords/probabilistic-computation-tree-logic","display_name":"PCTL","score":0.9300000071525574},{"id":"https://openalex.org/keywords/expected-behavior","display_name":"expected behavior","score":0.9150000214576721},{"id":"https://openalex.org/keywords/program-verification","display_name":"program verification","score":0.5509999990463257}],"concepts":[{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.8457513451576233},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7883855104446411},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7261857986450195},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.6784879565238953},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6563894748687744},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6535146236419678},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.6311370730400085},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5921482443809509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5315328240394592},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.5174963474273682},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.4881942868232727},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.4825969934463501},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.465981662273407},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.4515579640865326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4150241017341614},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40197527408599854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39967435598373413},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.3006627559661865},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1064504086971283},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.192.4112","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.4112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.fi.muni.cz/%7Exbrazdil/thesis.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.1360","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.1360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://is.muni.cz/th/4074/fi_r/thesis_proposal.pdf","raw_type":"text"},{"id":"mag:2610458644","doi":null,"is_oa":false,"landing_page_url":"http://www.fi.muni.cz/~xbrazdil/thesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1482647296","https://openalex.org/W1538639190","https://openalex.org/W1557750304","https://openalex.org/W1560050980","https://openalex.org/W1561838634","https://openalex.org/W1589224558","https://openalex.org/W1691700263","https://openalex.org/W1903527352","https://openalex.org/W1944241544","https://openalex.org/W1971947347","https://openalex.org/W2002089154","https://openalex.org/W2005998857","https://openalex.org/W2041403185","https://openalex.org/W2056099894","https://openalex.org/W2067754486","https://openalex.org/W2082000355","https://openalex.org/W2097415784","https://openalex.org/W2098543914","https://openalex.org/W2114132089","https://openalex.org/W2116976042","https://openalex.org/W2121431238","https://openalex.org/W2151033407","https://openalex.org/W2152923292","https://openalex.org/W2153358971","https://openalex.org/W2158487182","https://openalex.org/W2160634572","https://openalex.org/W2165161585","https://openalex.org/W2179042667","https://openalex.org/W2913459036"],"related_works":["https://openalex.org/W2167246417","https://openalex.org/W4389805083","https://openalex.org/W2152221608","https://openalex.org/W949146679","https://openalex.org/W1762969849","https://openalex.org/W4412514936","https://openalex.org/W2088970711","https://openalex.org/W7098953891","https://openalex.org/W1656025398","https://openalex.org/W1972203711"],"abstract_inverted_index":{"This":[0],"work":[1,44,86],"studies":[2],"algorithmic":[3],"verification":[4],"of":[5,24,35,42,51,75,81,101,143],"infinite-state":[6],"probabilistic":[7,11,22,57,82,133,141],"systems":[8],"generated":[9,59],"by":[10,60,93],"pushdown":[12,16,25],"automata":[13,17,26,95,159],"(pPDA).":[14],"Probabilistic":[15],"are":[18,73],"obtained":[19],"as":[20],"a":[21,31,55,61,64,69,140,151],"variant":[23,142],"that":[27],"proved":[28],"to":[29,46],"be":[30],"successful":[32],"abstract":[33],"model":[34],"recursive":[36],"sequential":[37],"programs.":[38],"The":[39],"main":[40],"aim":[41],"this":[43,85],"is":[45,139],"study":[47],"decidability":[48],"and":[49,99,107,120,132],"complexity":[50],"the":[52,144],"problem":[53],"whether":[54],"given":[56,65],"system":[58],"pPDA":[62],"satisfies":[63],"property":[66],"expressed":[67,92],"in":[68],"suitable":[70],"formalism.":[71],"There":[72],"plenty":[74],"formalisms":[76],"available":[77],"for":[78],"specifying":[79],"properties":[80,91,108],"systems.":[83],"In":[84],"we":[87,116,126],"consider":[88,117,127,150],"various":[89],"temporal":[90,102,114,129],"finite-state":[94],"on":[96],"infinite":[97],"words":[98],"formulae":[100],"logics,":[103,115],"long-run":[104],"average":[105],"properties,":[106],"connected":[109],"with":[110],"expected":[111],"behavior.":[112],"Concerning":[113],"both":[118],"linear":[119,128],"branching":[121],"time":[122],"ones.":[123],"Among":[124],"others":[125],"logic":[130,136,146,153],"(LTL)":[131],"computation":[134],"tree":[135],"(PCTL),":[137],"which":[138,157],"well-known":[145],"CTL.":[147],"We":[148],"also":[149],"general":[152],"PECTL":[154],"\u2217":[155],",":[156],"combines":[158],"based":[160]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2017-05-12T00:00:00"}
