{"id":"https://openalex.org/W2285849266","doi":"https://doi.org/10.1007/s00236-016-0290-1","title":"Reachability analysis of reversal-bounded automata on series\u2013parallel graphs","display_name":"Reachability analysis of reversal-bounded automata on series\u2013parallel graphs","publication_year":2016,"publication_date":"2016-12-18","ids":{"openalex":"https://openalex.org/W2285849266","doi":"https://doi.org/10.1007/s00236-016-0290-1","mag":"2285849266"},"language":"en","primary_location":{"id":"doi:10.1007/s00236-016-0290-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-016-0290-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-016-0290-1.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00236-016-0290-1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059464456","display_name":"Rayna Dimitrova","orcid":"https://orcid.org/0009-0006-2494-8690"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Rayna Dimitrova","raw_affiliation_strings":["Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210121786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081010207","display_name":"Rupak Majumdar","orcid":"https://orcid.org/0000-0003-2136-0542"},"institutions":[{"id":"https://openalex.org/I4210121786","display_name":"Max Planck Institute for Software Systems","ror":"https://ror.org/02pe2kf23","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210121786"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rupak Majumdar","raw_affiliation_strings":["Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern and Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210121786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5059464456"],"corresponding_institution_ids":["https://openalex.org/I4210121786"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":{"value":2990,"currency":"USD","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02484495,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"55","issue":"2","first_page":"153","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9983999729156494,"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.9983999729156494,"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.9965000152587891,"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/T10911","display_name":"Chemical Synthesis and Analysis","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5181547403335571},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4841480851173401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4810643196105957},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.4476531744003296},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.43971797823905945},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.4188953936100006},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4005560874938965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38726186752319336},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3864714801311493},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.32877224683761597},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2832023799419403}],"concepts":[{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5181547403335571},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4841480851173401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4810643196105957},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.4476531744003296},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.43971797823905945},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.4188953936100006},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4005560874938965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38726186752319336},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3864714801311493},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.32877224683761597},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2832023799419403}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s00236-016-0290-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-016-0290-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-016-0290-1.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:156436","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Proceedings Paper"},{"id":"pmh:oai:figshare.com:article/10193555","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Reachability_Analysis_of_Reversal-bounded_Automata_on_Series-Parallel_Graphs/10193555","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"<dc:type>Conference contribution"},{"id":"pmh:oai:figshare.com:article/10222097","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Reachability_analysis_of_reversal-bounded_automata_on_series-parallel_graphs/10222097","pdf_url":null,"source":{"id":"https://openalex.org/S4306402621","display_name":"INDIGO (University of Illinois at Chicago)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39422238","host_organization_name":"University of Illinois Chicago","host_organization_lineage":["https://openalex.org/I39422238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:lra.le.ac.uk:2381/41794","is_oa":true,"landing_page_url":"https://link.springer.com/article/10.1007%2Fs00236-016-0290-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306402365","display_name":"Leicester Research Archive (University of Leicester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153648349","host_organization_name":"University of Leicester","host_organization_lineage":["https://openalex.org/I153648349"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:pure.mpg.de:item_2247192","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0029-7969-6","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_3031705","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0003-1F7A-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Acta Informatica","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00236-016-0290-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00236-016-0290-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00236-016-0290-1.pdf","source":{"id":"https://openalex.org/S84409463","display_name":"Acta Informatica","issn_l":"0001-5903","issn":["0001-5903","1432-0525"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Acta Informatica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322434","display_name":"Max-Planck-Gesellschaft","ror":"https://ror.org/01hhn8329"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2285849266.pdf","grobid_xml":"https://content.openalex.org/works/W2285849266.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W8360613","https://openalex.org/W127565347","https://openalex.org/W170500743","https://openalex.org/W421997344","https://openalex.org/W1500886905","https://openalex.org/W1507479492","https://openalex.org/W1529497146","https://openalex.org/W1532092302","https://openalex.org/W1574587683","https://openalex.org/W1623604111","https://openalex.org/W1762311305","https://openalex.org/W1851906033","https://openalex.org/W1974451646","https://openalex.org/W1979876920","https://openalex.org/W1985604029","https://openalex.org/W1986359097","https://openalex.org/W2002089154","https://openalex.org/W2006337571","https://openalex.org/W2015110855","https://openalex.org/W2023999667","https://openalex.org/W2054801208","https://openalex.org/W2063156356","https://openalex.org/W2102697873","https://openalex.org/W2165546792","https://openalex.org/W2182252111","https://openalex.org/W2275786693","https://openalex.org/W2951129515","https://openalex.org/W3104023459","https://openalex.org/W4214848047","https://openalex.org/W4235239597","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W2765111002","https://openalex.org/W1750171350"],"abstract_inverted_index":{"Extensions":[0],"to":[1,17,37,190,195],"finite-state":[2],"automata":[3,9,50,113,124,186],"on":[4,52,60,150,165,177],"strings,":[5],"such":[6],"as":[7],"multi-head":[8,112],"or":[10],"multi-counter":[11],"automata,":[12],"have":[13],"been":[14],"successfully":[15],"used":[16],"encode":[18],"many":[19],"infinite-state":[20,33],"non-regular":[21],"verification":[22,34,70],"problems.":[23],"In":[24],"this":[25],"paper,":[26],"we":[27],"consider":[28,67],"a":[29,44,73,80,87,119,126,136],"generalization":[30],"of":[31,46,63,75,129,139,153,170,180,183],"automata-theoretic":[32],"from":[35],"strings":[36],"labelled":[38],"series\u2013parallel":[39,53,76,91,154],"graphs":[40,54,77,155],".":[41],"We":[42,66,116],"define":[43],"model":[45],"non-deterministic,":[47],"2-way,":[48],"concurrent":[49,88,185],"working":[51],"and":[55,86,134,176],"communicating":[56],"through":[57],"shared":[58,140],"registers":[59,141],"the":[61,64,68,98,102,123,132,151,158,168,181,192,196],"nodes":[62],"graph.":[65],"following":[69],"problem:":[71],"given":[72],"family":[74],"described":[78],"by":[79,97,101,157],"context-free":[81],"graph":[82,95,133],"transformation":[83],"system":[84],"(GTS),":[85],"automaton":[89],"over":[90,114],"graphs,":[92],"is":[93,107,142,147,163],"some":[94],"generated":[96,156],"GTS":[99],"accepted":[100],"automaton?":[103],"The":[104],"general":[105],"problem":[106,194,198],"undecidable":[108],"already":[109],"for":[110,199],"(one-way)":[111],"strings.":[115],"show":[117],"that":[118,167,187],"bounded":[120,175,184],"version,":[121],"where":[122],"make":[125],"fixed":[127,137],"number":[128,138,169],"reversals":[130],"along":[131],"use":[135],"decidable,":[143],"even":[144],"though":[145],"there":[146],"no":[148],"bound":[149],"sizes":[152],"GTS.":[159],"Our":[160],"decidability":[161],"result":[162],"based":[164],"establishing":[166],"context":[171],"switches":[172],"can":[173],"be":[174],"an":[178],"encoding":[179],"computation":[182],"allows":[188],"us":[189],"reduce":[191],"reachability":[193],"emptiness":[197],"pushdown":[200],"automata.":[201]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}