{"id":"https://openalex.org/W4210818343","doi":"https://doi.org/10.3233/fi-2021-1999","title":"Topological Characterisation of Multi-Buffer Simulation","display_name":"Topological Characterisation of Multi-Buffer Simulation","publication_year":2021,"publication_date":"2021-01-13","ids":{"openalex":"https://openalex.org/W4210818343","doi":"https://doi.org/10.3233/fi-2021-1999"},"language":"en","primary_location":{"id":"doi:10.3233/fi-2021-1999","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2021-1999","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","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/A5068084593","display_name":"Milka Hutagalung","orcid":null},"institutions":[{"id":"https://openalex.org/I106157433","display_name":"University of Kassel","ror":"https://ror.org/04zc7p361","country_code":"DE","type":"education","lineage":["https://openalex.org/I106157433"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Milka Hutagalung","raw_affiliation_strings":["University of Kassel, Germany. milka.hutagalung@uni-kassel.de"],"affiliations":[{"raw_affiliation_string":"University of Kassel, Germany. milka.hutagalung@uni-kassel.de","institution_ids":["https://openalex.org/I106157433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5068084593"],"corresponding_institution_ids":["https://openalex.org/I106157433"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27491127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"178","issue":"1-2","first_page":"77","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9988999962806702,"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.9909999966621399,"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/social-connectedness","display_name":"Social connectedness","score":0.707192063331604},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6749051809310913},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6220661401748657},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6204251050949097},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5834898352622986},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5743719339370728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5300571322441101},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5173213481903076},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5039157271385193},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.4810802638530731},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.47508683800697327},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4449102580547333},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.42266520857810974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4200061559677124},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41215139627456665},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4021190106868744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3898114562034607},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.3055981695652008},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17574480175971985},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1656501591205597},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10142958164215088}],"concepts":[{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.707192063331604},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6749051809310913},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6220661401748657},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6204251050949097},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5834898352622986},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5743719339370728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5300571322441101},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5173213481903076},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5039157271385193},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4810802638530731},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.47508683800697327},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4449102580547333},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.42266520857810974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4200061559677124},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41215139627456665},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4021190106868744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3898114562034607},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.3055981695652008},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17574480175971985},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1656501591205597},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10142958164215088},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"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":1,"locations":[{"id":"doi:10.3233/fi-2021-1999","is_oa":false,"landing_page_url":"https://doi.org/10.3233/fi-2021-1999","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fundamenta Informaticae","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.7200000286102295,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2026879508","https://openalex.org/W3135656023","https://openalex.org/W186350370","https://openalex.org/W2040844343","https://openalex.org/W4243666448","https://openalex.org/W1533908838","https://openalex.org/W2038787784","https://openalex.org/W2145225595","https://openalex.org/W2252455711","https://openalex.org/W2573882791"],"abstract_inverted_index":{"Multi-buffer":[0],"simulation":[1,6,44],"is":[2,149],"an":[3],"extension":[4],"of":[5,15,51,92,104,107,133],"preorder":[7],"that":[8,42,60,72,122,138,146],"can":[9,27,45,64,125],"be":[10,46,65,88,126],"used":[11],"to":[12,22,34,67,74,87],"approximate":[13],"inclusion":[14],"languages":[16],"recognised":[17],"by":[18,83],"B\u00fcchi":[19],"automata":[20,109,137],"up":[21],"their":[23],"trace":[24,141],"closures.":[25],"DUPLICATOR":[26,78],"use":[28],"some":[29,101],"bounded":[30,81],"or":[31],"unbounded":[32],"buffers":[33],"simulate":[35],"SPOILER\u2019s":[36],"move.":[37],"It":[38],"has":[39],"been":[40],"shown":[41],"multi-buffer":[43],"characterised":[47,128],"with":[48,129],"the":[49,75,85,108],"existence":[50],"a":[52,62,68,131],"continuous":[53,90],"function.":[54],"In":[55],"this":[56,123],"paper,":[57],"we":[58],"show":[59,121,145],"such":[61],"characterisation":[63,96],"refined":[66],"more":[69],"restricted":[70,102],"case,":[71],"is,":[73],"one":[76],"where":[77,114],"only":[79,93,98,111],"uses":[80],"buffers,":[82],"requiring":[84],"function":[86],"Lipschitz":[89],"instead":[91],"continuous.":[94],"This":[95],"however":[97],"holds":[99],"for":[100],"classes":[103],"automata.":[105],"One":[106],"should":[110],"produce":[112],"words":[113],"each":[115],"letter":[116],"cannot":[117],"commute":[118],"unboundedly.":[119],"We":[120,143],"property":[124],"syntactically":[127],"cyclic-path-connectedness,":[130],"refinement":[132],"syntactic":[134],"condition":[135],"on":[136],"have":[139],"regular":[140],"closure.":[142],"further":[144],"checking":[147],"cyclic-path-connectedness":[148],"indeed":[150],"co-NP-complete.":[151]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}