{"id":"https://openalex.org/W2051563352","doi":"https://doi.org/10.1145/1119772.1119951","title":"Don't cares in logic minimization of extended finite state machines","display_name":"Don't cares in logic minimization of extended finite state machines","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2051563352","doi":"https://doi.org/10.1145/1119772.1119951","mag":"2051563352"},"language":"en","primary_location":{"id":"doi:10.1145/1119772.1119951","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119772.1119951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 conference on Asia South Pacific design automation  - ASPDAC","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/A5011457437","display_name":"Yunjian Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yunjian Jiang","raw_affiliation_strings":["University of California, Berkeley, CA","Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, CA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064568178","display_name":"Robert K. Brayton","orcid":"https://orcid.org/0000-0002-3861-1718"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert K. Brayton","raw_affiliation_strings":["University of California, Berkeley, CA","Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, CA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput.Sci., California Univ., Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011457437"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.3634,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.61339876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"809","last_page":"809"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998000264167786,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.6512539386749268},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6074851155281067},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5927310585975647},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5920376777648926},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.5534392595291138},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.48920655250549316},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.48752066493034363},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41853445768356323},{"id":"https://openalex.org/keywords/extended-finite-state-machine","display_name":"Extended finite-state machine","score":0.41335344314575195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38691186904907227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23070797324180603},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.18375375866889954},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.1158357560634613}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6512539386749268},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6074851155281067},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5927310585975647},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5920376777648926},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.5534392595291138},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.48920655250549316},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.48752066493034363},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41853445768356323},{"id":"https://openalex.org/C181062253","wikidata":"https://www.wikidata.org/wiki/Q5421886","display_name":"Extended finite-state machine","level":3,"score":0.41335344314575195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38691186904907227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23070797324180603},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.18375375866889954},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.1158357560634613},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1119772.1119951","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119772.1119951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 conference on Asia South Pacific design automation  - ASPDAC","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.121.3629","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.3629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ieeexplore.ieee.org/iel5/8504/26878/01195129.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.373.2004","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.373.2004","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.york.ac.uk/rts/docs/SIGDA-Compendium-1994-2004/papers/2003/aspdac03/pdffiles/09a_2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6000000238418579}],"awards":[],"funders":[{"id":"https://openalex.org/F4320338292","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W74811763","https://openalex.org/W1511688816","https://openalex.org/W1777025722","https://openalex.org/W1822301642","https://openalex.org/W1982727451","https://openalex.org/W1985063883","https://openalex.org/W2008182907","https://openalex.org/W2008770192","https://openalex.org/W2061438988","https://openalex.org/W2081938726","https://openalex.org/W2105505307","https://openalex.org/W2108012986","https://openalex.org/W2117633725","https://openalex.org/W2120851481","https://openalex.org/W2128475506","https://openalex.org/W2138612658","https://openalex.org/W2150472531","https://openalex.org/W2157591717","https://openalex.org/W2160460506","https://openalex.org/W2164376138","https://openalex.org/W2218006079","https://openalex.org/W2503657378","https://openalex.org/W3178812393"],"related_works":["https://openalex.org/W4254792149","https://openalex.org/W4230357508","https://openalex.org/W2895802795","https://openalex.org/W2213014552","https://openalex.org/W4256073794","https://openalex.org/W2380965124","https://openalex.org/W2093565921","https://openalex.org/W2400459094","https://openalex.org/W2486976088","https://openalex.org/W1930392193"],"abstract_inverted_index":{"Extended":[0],"Finite":[1],"State":[2],"Machines":[3],"(EFSMs)":[4],"have":[5],"been":[6,26],"proposed":[7],"to":[8,57,66],"model":[9],"control":[10,49],"oriented":[11],"systems.":[12],"A":[13],"version":[14],"of":[15,55],"this,":[16],"with":[17],"the":[18,62,72,87],"data":[19,51,63,73],"portion":[20],"modeled":[21],"by":[22],"Presburger":[23,77],"arithmetic,":[24],"has":[25],"used":[27],"in":[28],"formal":[29],"verification":[30],"and":[31,50,65,83],"test":[32],"pattern":[33],"generation.":[34],"This":[35],"paper":[36],"proposes":[37],"a":[38],"general":[39],"logic":[40,68],"minimization":[41],"scheme":[42,88],"using":[43,75],"don't":[44,59,69],"care":[45],"derived":[46],"from":[47,71],"both":[48],"path.":[52],"It":[53],"consists":[54],"methods":[56],"transfer":[58],"cares":[60,70],"through":[61],"path":[64,74],"generate":[67],"quantifier-free":[76],"inequalities.":[78],"Potential":[79],"applications":[80],"are":[81],"discussed":[82],"preliminary":[84],"results":[85],"validate":[86],"on":[89],"reasonable":[90],"examples.":[91]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}