{"id":"https://openalex.org/W2122843152","doi":"https://doi.org/10.1145/2603088.2603161","title":"Zero-reachability in probabilistic multi-counter automata","display_name":"Zero-reachability in probabilistic multi-counter automata","publication_year":2014,"publication_date":"2014-07-14","ids":{"openalex":"https://openalex.org/W2122843152","doi":"https://doi.org/10.1145/2603088.2603161","mag":"2122843152"},"language":"en","primary_location":{"id":"doi:10.1145/2603088.2603161","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","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/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":["Masaryk University, Brno, Czech Republic","(Masaryk University, Brno, Czech Republic)"],"affiliations":[{"raw_affiliation_string":"Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"(Masaryk University, Brno, Czech Republic)","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054782057","display_name":"Stefan Kiefer","orcid":"https://orcid.org/0000-0003-4173-6877"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Stefan Kiefer","raw_affiliation_strings":["University of Oxford, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"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/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":["Masaryk University, Brno, Czech Republic","(Masaryk University, Brno, Czech Republic)"],"affiliations":[{"raw_affiliation_string":"Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"(Masaryk University, Brno, Czech Republic)","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026464429","display_name":"Petr Novotn\u00fd","orcid":"https://orcid.org/0000-0002-5026-4392"},"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":"Petr Novotn\u00fd","raw_affiliation_strings":["Masaryk University, Brno, Czech Republic","(Masaryk University, Brno, Czech Republic)"],"affiliations":[{"raw_affiliation_string":"Masaryk University, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]},{"raw_affiliation_string":"(Masaryk University, Brno, Czech Republic)","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090819329","display_name":"Joost-Pieter Katoen","orcid":"https://orcid.org/0000-0002-6143-1926"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Joost-Pieter Katoen","raw_affiliation_strings":["RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5082160514"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":null,"apc_paid":null,"fwci":2.8486,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91103732,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1601","issue":null,"first_page":"1","last_page":"10"},"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.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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9959999918937683,"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/reachability","display_name":"Reachability","score":0.845921516418457},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7903870344161987},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7859945297241211},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.7604500651359558},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6778306365013123},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6285296678543091},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5920199155807495},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5775160789489746},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5498608350753784},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5273523926734924},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5240359902381897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3611006736755371},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3363904654979706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29814720153808594},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09746575355529785},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07094159722328186}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.845921516418457},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7903870344161987},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7859945297241211},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.7604500651359558},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6778306365013123},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6285296678543091},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5920199155807495},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5775160789489746},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5498608350753784},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5273523926734924},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5240359902381897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3611006736755371},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3363904654979706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29814720153808594},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09746575355529785},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07094159722328186},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2603088.2603161","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.754.8139","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.754.8139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1401.6840.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7803096842","display_name":null,"funder_award_id":"P202/12/P612","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W263470693","https://openalex.org/W755194005","https://openalex.org/W1561424154","https://openalex.org/W1561838634","https://openalex.org/W1596041124","https://openalex.org/W1602747308","https://openalex.org/W1944241544","https://openalex.org/W1967459525","https://openalex.org/W1973255353","https://openalex.org/W1976335834","https://openalex.org/W2012140001","https://openalex.org/W2028192443","https://openalex.org/W2038983654","https://openalex.org/W2040721698","https://openalex.org/W2066238373","https://openalex.org/W2075379212","https://openalex.org/W2079636926","https://openalex.org/W2096610849","https://openalex.org/W2103918658","https://openalex.org/W2120349285","https://openalex.org/W2122843152","https://openalex.org/W2125739093","https://openalex.org/W2128841330","https://openalex.org/W2136866815","https://openalex.org/W2137464431","https://openalex.org/W2138467892","https://openalex.org/W2142972886","https://openalex.org/W2148701797","https://openalex.org/W2151426330","https://openalex.org/W2155340214","https://openalex.org/W2532902810","https://openalex.org/W2952530952","https://openalex.org/W3098993010","https://openalex.org/W3099302600","https://openalex.org/W3143684945","https://openalex.org/W3150153037","https://openalex.org/W6680530919"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W2099490078","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W1993478572"],"abstract_inverted_index":{"We":[0,12],"study":[1],"the":[2,14,18,25,30,38,52,63,73,81,110,120,125,132,145,152,160,202],"qualitative":[3,53,153],"and":[4,20,69,116,157,159],"quantitative":[5],"zero-reachability":[6,54,154],"problem":[7],"in":[8,37,46,57,62,72,101,106,109,119,131,140,194,201,215],"probabilistic":[9],"multi-counter":[10],"systems.":[11],"identify":[13],"undecidable":[15],"variants":[16],"of":[17,40,65,75,83,112,122,134,162],"problems,":[19],"then":[21],"we":[22,34,49,78,128,149],"concentrate":[23],"on":[24],"remaining":[26],"two":[27],"cases.":[28],"In":[29,124],"first":[31],"case,":[32,127],"when":[33],"are":[35,129],"interested":[36,130],"probability":[39,82,133,161],"all":[41,84,135,163],"runs":[42,86,136,165],"that":[43,51,80,137,151,190],"visit":[44,138],"zero":[45,139],"some":[47,141,210],"counter,":[48],"show":[50,79,150],"is":[55,60,104,155],"decidable":[56,156],"time":[58,102],"which":[59,103],"polynomial":[61,105,195],"size":[64,111],"a":[66,113,186],"given":[67,96,114,175],"pMC":[68,184],"doubly":[70,117],"exponential":[71,108,118],"number":[74,121],"counters.":[76,123],"Further,":[77],"zero-reaching":[85,164],"can":[87,166,191],"be":[88,167,192],"effectively":[89,168],"approximated":[90,169],"up":[91,170],"to":[92,171,183,206],"an":[93,172],"arbitrarily":[94,173],"small":[95,174],"error":[97,176],"\u03b5":[98,177],">":[99,178],"0":[100,179],"log(\u03b5),":[107],"pMC,":[115],"second":[126,203],"counter":[142],"different":[143],"from":[144],"last":[146],"counter.":[147],"Here":[148],"SquareRootSum-hard,":[158],"(these":[180],"results":[181,212],"apply":[182],"satisfying":[185],"suitable":[187],"technical":[188],"condition":[189],"verified":[193],"time).":[196],"The":[197],"proof":[198],"techniques":[199],"invented":[200],"case":[204],"allow":[205],"construct":[207],"counterexamples":[208],"for":[209],"classical":[211],"about":[213],"ergodicity":[214],"stochastic":[216],"Petri":[217],"nets.":[218]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}