{"id":"https://openalex.org/W2008973779","doi":"https://doi.org/10.1142/s0129054102000984","title":"VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES","display_name":"VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES","publication_year":2002,"publication_date":"2002-02-01","ids":{"openalex":"https://openalex.org/W2008973779","doi":"https://doi.org/10.1142/s0129054102000984","mag":"2008973779"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054102000984","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054102000984","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":true,"raw_author_name":"OSCAR H. IBARRA","raw_affiliation_strings":["Department of Computer Science,  University of California, Santa Barbara, California 93106, U.S.A","Department of Computer Science, University of California, Santa Barbara, California 93106, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  University of California, Santa Barbara, California 93106, U.S.A","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Department of Computer Science, University of California, Santa Barbara, California 93106, U.S.A","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110211208"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12129586,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"01","first_page":"115","last_page":"127"},"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/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7823992371559143},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7456908822059631},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7447524070739746},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5882482528686523},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4985775947570801},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4926448464393616},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.4529499113559723},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.43967053294181824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3455526828765869},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33937889337539673},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1964406967163086}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7823992371559143},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7456908822059631},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7447524070739746},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5882482528686523},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4985775947570801},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4926448464393616},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.4529499113559723},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.43967053294181824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3455526828765869},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33937889337539673},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1964406967163086}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054102000984","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054102000984","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1532358383","https://openalex.org/W1977601940","https://openalex.org/W1979876920","https://openalex.org/W1981808971","https://openalex.org/W1988946128","https://openalex.org/W2012525080","https://openalex.org/W2023999667","https://openalex.org/W2030263557","https://openalex.org/W2046895474","https://openalex.org/W2061970672","https://openalex.org/W2101508170","https://openalex.org/W2130773092"],"related_works":["https://openalex.org/W2032269072","https://openalex.org/W1989788631","https://openalex.org/W1999231617","https://openalex.org/W2150583165","https://openalex.org/W2618109676","https://openalex.org/W4224983736","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2150468037"],"abstract_inverted_index":{"We":[0,75,91],"look":[1,93],"at":[2,94],"a":[3,6,109],"model":[4],"of":[5,11,72,79,96,116],"queue":[7,106],"system":[8],"which":[9],"consists":[10],"two":[12],"nondeterministic":[13],"finite-state":[14],"machines,":[15,118],"each":[16],"augmented":[17],"with":[18],"\"reversal-bounded\"":[19],"counters,":[20],"connected":[21],"by":[22],"an":[23],"unbounded":[24],"queue.":[25,40,74],"One":[26],"machine":[27],"(the":[28,36],"\"writer\")":[29],"can":[30,64],"send":[31],"messages":[32],"to":[33,102,112],"the":[34,39,47,53,59,62,70,73,77,97,100,117],"other":[35],"\"reader\")":[37],"via":[38],"There":[41],"is":[42],"no":[43],"central":[44],"control,":[45],"but":[46],"machines":[48,133],"operate":[49],"synchronously":[50],"and":[51,89],"share":[52],"same":[54],"global":[55],"clock.":[56],"Unlike":[57],"in":[58,135],"traditional":[60],"model,":[61],"writer":[63,101],"make":[65],"conditional":[66],"moves":[67],"that":[68],"test":[69,104],"emptiness":[71],"investigate":[76],"decidability":[78],"various":[80],"verification":[81],"problems,":[82],"e.g.,":[83],"(binary,":[84],"forward,":[85],"backward)":[86],"reachability,":[87],"safety,":[88],"blocking.":[90],"also":[92,103],"extensions":[95],"model:":[98],"allowing":[99,119],"for":[105],"emptiness,":[107],"adding":[108],"pushdown":[110],"stack":[111],"one":[113],"or":[114,122],"both":[115],"multiple":[120],"queues":[121],"two-way":[123],"communication,":[124],"etc.":[125],"Finally,":[126],"we":[127],"consider":[128],"some":[129],"reachability":[130],"questions":[131],"concerning":[132],"operating":[134],"parallel.":[136]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}