{"id":"https://openalex.org/W2078894460","doi":"https://doi.org/10.1137/120876435","title":"Branching-Time Model Checking of One-Counter Processes and Timed Automata","display_name":"Branching-Time Model Checking of One-Counter Processes and Timed Automata","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2078894460","doi":"https://doi.org/10.1137/120876435","mag":"2078894460"},"language":"en","primary_location":{"id":"doi:10.1137/120876435","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120876435","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5079767975","display_name":"Stefan G\u00f6ller","orcid":"https://orcid.org/0000-0003-1747-1282"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan G\u00f6ller","raw_affiliation_strings":["(University of Bremen)"],"affiliations":[{"raw_affiliation_string":"(University of Bremen)","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005500210","display_name":"Markus Lohrey","orcid":"https://orcid.org/0000-0002-4680-7198"},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Lohrey","raw_affiliation_strings":["#N##TAB##TAB##TAB##TAB# Leipzig University#N##TAB##TAB##TAB#"],"affiliations":[{"raw_affiliation_string":"#N##TAB##TAB##TAB##TAB# Leipzig University#N##TAB##TAB##TAB#","institution_ids":["https://openalex.org/I926574661"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079767975"],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":null,"apc_paid":null,"fwci":1.8127,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85663781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"42","issue":"3","first_page":"884","last_page":"923"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9976000189781189,"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.9929999709129333,"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/pspace","display_name":"PSPACE","score":0.7306967377662659},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.600287675857544},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5631998777389526},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5376092195510864},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.5203299522399902},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5007979869842529},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2581467926502228},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22184422612190247}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.7306967377662659},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.600287675857544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5631998777389526},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5376092195510864},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.5203299522399902},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5007979869842529},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2581467926502228},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22184422612190247}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/120876435","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120876435","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W1482647296","https://openalex.org/W1487351738","https://openalex.org/W1491036809","https://openalex.org/W1498432697","https://openalex.org/W1508260233","https://openalex.org/W1512597804","https://openalex.org/W1527197079","https://openalex.org/W1532209667","https://openalex.org/W1551781434","https://openalex.org/W1557750304","https://openalex.org/W1560508321","https://openalex.org/W1584527051","https://openalex.org/W1589224558","https://openalex.org/W1816633894","https://openalex.org/W1855477342","https://openalex.org/W1967459525","https://openalex.org/W1970901627","https://openalex.org/W1972164030","https://openalex.org/W1999507562","https://openalex.org/W2003519998","https://openalex.org/W2024091095","https://openalex.org/W2025079043","https://openalex.org/W2034955756","https://openalex.org/W2068462394","https://openalex.org/W2088044688","https://openalex.org/W2096289723","https://openalex.org/W2101321886","https://openalex.org/W2101508170","https://openalex.org/W2125463200","https://openalex.org/W2128797960","https://openalex.org/W2148775051","https://openalex.org/W2170299515","https://openalex.org/W2962794883","https://openalex.org/W3022006420","https://openalex.org/W4246799703"],"related_works":["https://openalex.org/W2110302191","https://openalex.org/W4302143739","https://openalex.org/W2791452273","https://openalex.org/W2045826397","https://openalex.org/W2065896142","https://openalex.org/W3213392216","https://openalex.org/W3030465535","https://openalex.org/W2928935854","https://openalex.org/W2020230082","https://openalex.org/W2095282951"],"abstract_inverted_index":{"One-counter":[0],"automata":[1,5,324],"(OCA)":[2],"are":[3],"pushdown":[4],"which":[6,157,319],"operate":[7],"only":[8,69],"on":[9,26],"a":[10,60,77,99,109,152,185,232,248,253,291,314,328],"unary":[11],"stack":[12],"alphabet.":[13],"We":[14,204,216],"study":[15],"the":[16,39,51,71,81,119,173,240,270,273,281,300,332],"computational":[17],"complexity":[18,121,142,166,181,334],"of":[19,54,73,80,113,122,160,255,280,299],"model":[20,61,91,136,158,219,320],"checking":[21,62,92,137,159,220,321],"computation":[22],"tree":[23],"logic":[24],"(${\\mathsf{CTL}}$)":[25],"transition":[27],"systems":[28],"induced":[29],"by":[30,46,304,335],"OCA.":[31],"A":[32],"${\\mathsf{PSPACE}}$":[33,201],"upper":[34],"bound":[35,295],"is":[36,67,104,138,143,162,167,195,202,226,243,284,313,325],"inherited":[37],"from":[38,180],"modal":[40],"$\\mu$-calculus":[41],"for":[42,118,156,228,245,296,318,331],"this":[43],"problem":[44,242],"proved":[45,293],"Serre.":[47],"First,":[48],"we":[49,84,127,146,176,237,309],"analyze":[50],"periodic":[52],"behavior":[53],"${\\mathsf{CTL}}$":[55,96,135,154,316],"over":[56,131,224],"OCA":[57,94,161,225],"and":[58,76,116,199,263,338],"derive":[59],"algorithm":[63],"whose":[64],"running":[65],"time":[66],"exponential":[68],"in":[70,105,188,196],"number":[72,187],"control":[74],"locations":[75],"syntactic":[78],"notion":[79],"formula":[82,155,317],"that":[83,129,148,206,218,239,272,311],"call":[85],"leftward":[86,101],"until":[87,102],"depth.":[88],"In":[89],"particular,":[90],"fixed":[93,100,133,153,315],"against":[95],"formulas":[97],"with":[98,258],"depth":[103],"$\\mathsf{P}$.":[106],"This":[107,289],"generalizes":[108],"corresponding":[110],"recent":[111],"result":[112,330],"G\u00f6ller,":[114],"Mayr,":[115],"To":[117,171],"expression":[120,141],"${\\mathsf{CTL}}$'s":[123,221],"fragment":[124,222],"${\\mathsf{EF}}$.":[125],"Second,":[126],"prove":[128,310],"already":[130,150],"some":[132],"OCA,":[134],"${\\mathsf{PSPACE}}$-hard,":[139,163,326],"i.e.,":[140,164],"${\\mathsf{PSPACE}}$-hard.":[144],"Third,":[145],"show":[147,217,238],"there":[149,312],"exists":[151],"data":[165],"${\\mathsf{PSPACE}}$-hard":[168],"as":[169],"well.":[170],"obtain":[172,213],"latter":[174],"result,":[175],"employ":[177],"two":[178],"results":[179],"theory:":[182],"(i)":[183],"Converting":[184],"natural":[186],"Chinese":[189],"remainder":[190],"presentation":[191,194],"into":[192],"binary":[193],"logspace-uniform":[197],"${\\mathsf{NC}}^1$":[198],"(ii)":[200],"$\\mathsf{AC}^0$-serializable.":[203],"demonstrate":[205],"our":[207],"approach":[208],"can":[209],"be":[210],"used":[211],"to":[212,267,287],"further":[214],"results.":[215],"${\\mathsf{EF}}$":[223],"hard":[227,244],"$\\mathsf{P}^{\\mathsf{NP}}$,":[229],"thus":[230],"establishing":[231],"matching":[233],"lower":[234,294],"bound.":[235],"Moreover,":[236],"following":[241],"${\\mathsf{PSPACE}}$:":[246],"Given":[247],"one-counter":[249],"Markov":[250],"decision":[251],"process,":[252],"set":[254],"target":[256,282],"states":[257,283],"counter":[259],"value":[260],"zero":[261],"each,":[262],"an":[264],"initial":[265,274],"state,":[266],"decide":[268],"whether":[269],"probability":[271],"state":[275],"will":[276],"eventually":[277],"reach":[278],"one":[279],"arbitrarily":[285],"close":[286],"$1$.":[288],"improves":[290],"recently":[292],"every":[297],"level":[298],"boolean":[301],"hierarchy":[302],"shown":[303],"Br\u00e1zdil":[305],"et":[306],"al.":[307],"Finally,":[308],"2-clock":[322],"timed":[323],"generalizing":[327],"${\\mathsf{PSPACE}}$-hardness":[329],"combined":[333],"Laroussinie,":[336],"Markey,":[337],"Schnoebelen.":[339]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}