{"id":"https://openalex.org/W2067723582","doi":"https://doi.org/10.1142/s0129054101000898","title":"ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS","display_name":"ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W2067723582","doi":"https://doi.org/10.1142/s0129054101000898","mag":"2067723582"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054101000898","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054101000898","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5110211208","display_name":"\u00d3scar H. Ibarra","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"OSCAR H. IBARRA","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA 93106, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039991493","display_name":"Tevfik Bultan","orcid":"https://orcid.org/0000-0003-2993-1215"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"TEVFIK BULTAN","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA 93106, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069491635","display_name":"Jianwen Su","orcid":"https://orcid.org/0000-0002-4637-1339"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JIANWEN SU","raw_affiliation_strings":["Department of Computer Science, University of California, Santa Barbara, CA 93106, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, CA 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":0.9092,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75856152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"06","first_page":"821","last_page":"836"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"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/reachability","display_name":"Reachability","score":0.6865202784538269},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6600463390350342},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6139094829559326},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.554829478263855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4810640811920166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.472270131111145},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.46684202551841736},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4278521239757538},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41118475794792175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37746649980545044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31797701120376587},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27541834115982056}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6865202784538269},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6600463390350342},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6139094829559326},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.554829478263855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4810640811920166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.472270131111145},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.46684202551841736},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4278521239757538},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41118475794792175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37746649980545044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31797701120376587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27541834115982056},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054101000898","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054101000898","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.6928","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.6928","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~bultan/publications/ijfcs01.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4699999988079071,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W260642817","https://openalex.org/W1516753891","https://openalex.org/W1582986256","https://openalex.org/W1945689202","https://openalex.org/W1977601940","https://openalex.org/W1979876920","https://openalex.org/W1981808971","https://openalex.org/W1988946128","https://openalex.org/W1995151557","https://openalex.org/W2023999667","https://openalex.org/W2030263557","https://openalex.org/W2061438988","https://openalex.org/W2061970672","https://openalex.org/W2090106217","https://openalex.org/W2101508170","https://openalex.org/W2116976042","https://openalex.org/W2130773092","https://openalex.org/W2164502223"],"related_works":["https://openalex.org/W4300463216","https://openalex.org/W2770489137","https://openalex.org/W2790652601","https://openalex.org/W2100596986","https://openalex.org/W2143578569","https://openalex.org/W2164968206","https://openalex.org/W2538831380","https://openalex.org/W2170132780","https://openalex.org/W2081923730","https://openalex.org/W2009340103"],"abstract_inverted_index":{"We":[0,67,213,230,254],"introduce":[1],"some":[2,75],"new":[3],"models":[4,237],"of":[5,46,64,116,128,137,179,203,235,242],"infinite-state":[6],"transition":[7],"systems.":[8],"The":[9],"basic":[10],"model,":[11],"called":[12],"a":[13,19,61,69,86,101,105,134,157,166,170,193,200],"(reversal-bounded)":[14],"counter":[15,31,82,97,162],"machine":[16,83,98,163],"(CM),":[17],"is":[18,58,85,100,110,131,143,146,165,173,190,199,211],"nondeterministic":[20],"finite":[21],"automaton":[22],"augmented":[23,88,103,168],"with":[24,74,89,104,169],"finitely":[25],"many":[26],"reversal-bounded":[27],"counters":[28,247],"(i.e.":[29],"each":[30],"can":[32,49,154],"be":[33],"incremented":[34],"or":[35],"decremented":[36],"by":[37,60,71,133,192],"1":[38],"and":[39,56,184,206,219,223,248],"tested":[40],"for":[41,225],"zero,":[42],"but":[43],"the":[44,65,114,118,121,129,138,141,152,177,188,209,236,240,246,256],"number":[45,115,178],"times":[47,117],"it":[48,73],"change":[50],"mode":[51],"from":[52],"nondecreasing":[53],"to":[54],"nonincreasing":[55],"vice-versa":[57],"bounded":[59,132,191],"constant,":[62,135],"independent":[63,136],"computation).":[66],"extend":[68],"CM":[70,87,102,167],"augmenting":[72],"familiar":[76],"data":[77],"structures:":[78],"(i)":[79],"A":[80,95,160,195],"pushdown":[81,92],"(PCM)":[84],"an":[90],"unrestricted":[91],"stack.":[93],"(ii)":[94],"tape":[96],"(TCM)":[99],"two-way":[106],"read/write":[107],"worktape":[108,130,142],"that":[109,113,172,176,215,238],"restricted":[111,174],"in":[112,175],"head":[119,153],"crosses":[120],"boundary":[122],"between":[123,181],"any":[124],"two":[125],"adjacent":[126],"cells":[127],"computation":[139],"(thus,":[140],"finite-crossing).":[144],"There":[145],"no":[147],"bound":[148],"on":[149,156,187],"how":[150],"long":[151],"remain":[155],"cell.":[158],"(iii)":[159],"queue":[161,171,189,210],"(QCM)":[164],"alternations":[180],"non-deletion":[182,196],"phase":[183,186,198],"non-insertion":[185],"constant.":[194],"(non-insertion)":[197],"period":[201],"consisting":[202],"insertions":[204],"(deletions)":[205],"no-changes,":[207],"i.e.,":[208],"idle.":[212],"show":[214],"emptiness,":[216],"(binary,":[217],"forward,":[218],"backward)":[220],"reachability,":[221],"nonsafety,":[222],"invariance":[224],"these":[226,260],"machines":[227],"are":[228,262],"solvable.":[229,264],"also":[231],"look":[232],"at":[233],"extensions":[234],"allow":[239],"use":[241],"linear-relation":[243],"tests":[244],"among":[245],"parameterized":[249],"constants":[250],"as":[251],"\"primitive\"":[252],"predicates.":[253],"investigate":[255],"conditions":[257],"under":[258],"which":[259],"problems":[261],"still":[263]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}