{"id":"https://openalex.org/W2543669550","doi":"https://doi.org/10.1109/acssc.2011.6190172","title":"Optimal state estimation for Boolean dynamical systems","display_name":"Optimal state estimation for Boolean dynamical systems","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2543669550","doi":"https://doi.org/10.1109/acssc.2011.6190172","mag":"2543669550"},"language":"en","primary_location":{"id":"doi:10.1109/acssc.2011.6190172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2011.6190172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)","raw_type":"proceedings-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/A5026990034","display_name":"Ulisses Braga-Neto","orcid":"https://orcid.org/0000-0002-1210-2173"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ulisses Braga-Neto","raw_affiliation_strings":["Department of Electrical Engineering, Texas A and M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026990034"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.5211,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.66455565,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1050","last_page":"1054"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9496999979019165,"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"}},{"id":"https://openalex.org/T11236","display_name":"Control Systems and Identification","score":0.9495000243186951,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.7015605568885803},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.6004423499107361},{"id":"https://openalex.org/keywords/standard-boolean-model","display_name":"Standard Boolean model","score":0.5995153188705444},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.5407547950744629},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.5346791744232178},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5126563906669617},{"id":"https://openalex.org/keywords/kalman-filter","display_name":"Kalman filter","score":0.5067678093910217},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.5025284290313721},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.48938506841659546},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4888615012168884},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4725758135318756},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.46387991309165955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4606281816959381},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.45989659428596497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44739216566085815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4179965555667877},{"id":"https://openalex.org/keywords/boolean-model","display_name":"Boolean model","score":0.4161965847015381},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2916012406349182},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10063272714614868}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7015605568885803},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.6004423499107361},{"id":"https://openalex.org/C68481662","wikidata":"https://www.wikidata.org/wiki/Q176197","display_name":"Standard Boolean model","level":5,"score":0.5995153188705444},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.5407547950744629},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.5346791744232178},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5126563906669617},{"id":"https://openalex.org/C157286648","wikidata":"https://www.wikidata.org/wiki/Q846780","display_name":"Kalman filter","level":2,"score":0.5067678093910217},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.5025284290313721},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.48938506841659546},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4888615012168884},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4725758135318756},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.46387991309165955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4606281816959381},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.45989659428596497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44739216566085815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4179965555667877},{"id":"https://openalex.org/C67499762","wikidata":"https://www.wikidata.org/wiki/Q4943358","display_name":"Boolean model","level":2,"score":0.4161965847015381},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2916012406349182},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10063272714614868},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acssc.2011.6190172","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2011.6190172","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)","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":14,"referenced_works":["https://openalex.org/W1542537254","https://openalex.org/W1603631609","https://openalex.org/W1941464190","https://openalex.org/W2004445027","https://openalex.org/W2084757087","https://openalex.org/W2108020239","https://openalex.org/W2117327695","https://openalex.org/W2154642947","https://openalex.org/W2160533336","https://openalex.org/W2207662037","https://openalex.org/W2790374560","https://openalex.org/W4242024146","https://openalex.org/W4300432631","https://openalex.org/W6632300202"],"related_works":["https://openalex.org/W1568384982","https://openalex.org/W1745650241","https://openalex.org/W2409795543","https://openalex.org/W3141532631","https://openalex.org/W2995617542","https://openalex.org/W2131164334","https://openalex.org/W1996276855","https://openalex.org/W4243221174","https://openalex.org/W67752311","https://openalex.org/W4231391991"],"abstract_inverted_index":{"A":[0],"novel":[1],"state-space":[2],"signal":[3],"model":[4,45],"is":[5,14,29,46,57,65],"proposed":[6],"for":[7,43,59,74],"discrete-time":[8],"Boolean":[9,17,49,76],"dynamical":[10],"systems.":[11],"State":[12],"evolution":[13],"governed":[15],"by":[16],"functions":[18],"(i.e.,":[19],"logic":[20],"gates)":[21],"plus":[22,35],"binary":[23],"noise.":[24,37],"The":[25,38,63],"current":[26],"system":[27],"state":[28],"observed":[30],"through":[31,67],"an":[32,54,68],"arbitrary":[33],"function":[34],"observation":[36],"optimal":[39,71],"recursive":[40],"MMSE":[41],"estimator":[42],"this":[44],"called":[47],"the":[48],"Kalman":[50],"filter":[51],"(BKF),":[52],"and":[53],"efficient":[55],"algorithm":[56],"presented":[58],"its":[60],"exact":[61],"computation.":[62],"BKF":[64],"illustrated":[66],"example":[69],"of":[70],"context":[72],"inference":[73],"Probabilistic":[75],"Networks.":[77]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}