{"id":"https://openalex.org/W2119416645","doi":"https://doi.org/10.1109/acc.2006.1657692","title":"Finite bisimulation of reactive untimed infinite state systems modeled as automata with variables","display_name":"Finite bisimulation of reactive untimed infinite state systems modeled as automata with variables","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2119416645","doi":"https://doi.org/10.1109/acc.2006.1657692","mag":"2119416645"},"language":"en","primary_location":{"id":"doi:10.1109/acc.2006.1657692","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2006.1657692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 American Control Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5044031773","display_name":"Ratnesh Kumar","orcid":"https://orcid.org/0000-0003-3974-5790"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Kumar","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039053067","display_name":"Changyan Zhou","orcid":"https://orcid.org/0009-0000-5253-9057"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Zhou","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056774275","display_name":"Sriparna Basu","orcid":"https://orcid.org/0000-0001-7924-8153"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Basu","raw_affiliation_strings":["Department of Computer Science, Iowa State University, Ames, IA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":2.0607,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85840563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"6 pp.","last_page":"6 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9986000061035156,"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.9970999956130981,"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/bisimulation","display_name":"Bisimulation","score":0.7422354817390442},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6332716345787048},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5783807039260864},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.5699036121368408},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.552311897277832},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.5314024686813354},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.5106063485145569},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.49811601638793945},{"id":"https://openalex.org/keywords/quotient","display_name":"Quotient","score":0.4774092435836792},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.4677842855453491},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4621065557003021},{"id":"https://openalex.org/keywords/hybrid-automaton","display_name":"Hybrid automaton","score":0.4554133713245392},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4425663948059082},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43870440125465393},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4334673285484314},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.41691023111343384},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.4029497504234314},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.362551212310791},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2681449055671692},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.18703216314315796},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1733662188053131},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13118037581443787}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.7422354817390442},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6332716345787048},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5783807039260864},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.5699036121368408},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.552311897277832},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.5314024686813354},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.5106063485145569},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.49811601638793945},{"id":"https://openalex.org/C199422724","wikidata":"https://www.wikidata.org/wiki/Q41118","display_name":"Quotient","level":2,"score":0.4774092435836792},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.4677842855453491},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4621065557003021},{"id":"https://openalex.org/C2776028153","wikidata":"https://www.wikidata.org/wiki/Q5953179","display_name":"Hybrid automaton","level":3,"score":0.4554133713245392},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4425663948059082},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43870440125465393},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4334673285484314},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.41691023111343384},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4029497504234314},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.362551212310791},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2681449055671692},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.18703216314315796},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1733662188053131},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13118037581443787},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":1,"locations":[{"id":"doi:10.1109/acc.2006.1657692","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acc.2006.1657692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 American Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1522645051","https://openalex.org/W1523452604","https://openalex.org/W1977116278","https://openalex.org/W1987073197","https://openalex.org/W2061930075","https://openalex.org/W2101508170","https://openalex.org/W2109080678","https://openalex.org/W2117218135","https://openalex.org/W2128475506","https://openalex.org/W2142830749","https://openalex.org/W2147340401","https://openalex.org/W2913663755","https://openalex.org/W6631493839"],"related_works":["https://openalex.org/W2024315516","https://openalex.org/W2026879508","https://openalex.org/W2139519154","https://openalex.org/W2010706856","https://openalex.org/W2408583837","https://openalex.org/W186350370","https://openalex.org/W2499762659","https://openalex.org/W3133748972","https://openalex.org/W2106606282","https://openalex.org/W3135656023"],"abstract_inverted_index":{"Some":[0],"discrete":[1,56],"event":[2],"systems":[3,43],"such":[4,21,58],"as":[5,22,59,66,118],"software":[6],"are":[7],"typically":[8],"infinite":[9,41],"state":[10,42,130],"systems,":[11],"and":[12,62],"a":[13,36,67,84,91,96,109,125,135,141],"commonly":[14],"used":[15],"technique":[16],"for":[17,38,139],"performing":[18],"formal":[19],"analysis":[20],"automated":[23],"verification":[24],"is":[25,51,88,116],"based":[26],"on":[27,121],"their":[28],"finite":[29,47,76,85,110],"abstractions.":[30],"In":[31],"this":[32],"paper,":[33],"we":[34],"consider":[35],"model":[37,68],"reactive":[39],"untimed":[40],"called":[44],"input-output":[45],"extended":[46,54],"automaton":[48,53],"(I/O-EFA),":[49],"which":[50,100,140],"an":[52,106],"with":[55],"variables":[57],"inputs,":[60],"outputs,":[61],"data.":[63],"Using":[64],"I/O-EFA":[65,107,157],"many":[69],"value-passing":[70],"processes":[71],"can":[72,147],"be":[73,148],"represented":[74],"by":[75,150],"graphs.":[77],"We":[78,94,132],"study":[79],"the":[80,101,122,129,152,155],"problem":[81],"of":[82,105,124,128,137,154],"finding":[83],"abstraction":[86],"that":[87],"bisimilar":[89,111],"to":[90],"given":[92,156],"I/O-EFA.":[93],"present":[95],"sufficient":[97,114,145],"condition":[98,115,146],"under":[99],"underlying":[102],"transition":[103],"system":[104],"admits":[108],"quotient.":[112],"This":[113],"existential":[117],"it":[119],"relies":[120],"existence":[123],"suitable":[126],"partition":[127,142],"space.":[131],"then":[133],"identify":[134],"class":[136],"I/O-EFAs":[138],"satisfying":[143],"our":[144],"constructed":[149],"inspecting":[151],"structure":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}