{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:53:43Z","timestamp":1648619623429},"reference-count":26,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0141-9331(01)00112-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:09:00Z","timestamp":1027606140000},"page":"195-202","source":"Crossref","is-referenced-by-count":1,"title":["A distributed algorithm for finding prime compatibles on network of workstations"],"prefix":"10.1016","volume":"25","author":[{"given":"Imtiaz","family":"Ahmad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"September","key":"10.1016\/S0141-9331(01)00112-0_BIB1","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","article-title":"Minimizing the number of states in incompletely specified sequential switching functions","volume":"8","author":"Paul","year":"1959","journal-title":"IRE Transactions on Electronic Computers"},{"issue":"June","key":"10.1016\/S0141-9331(01)00112-0_BIB2","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/PGEC.1965.264140","article-title":"A method for minimizing the number of internal states in incompletely specified sequential networks","author":"Grasselli","year":"1965","journal-title":"IEEE Transactions on Electronic Computers"},{"issue":"February","key":"10.1016\/S0141-9331(01)00112-0_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/T-C.1971.223221","article-title":"An improved method of prime C-class derivation in the state reduction of sequential networks","volume":"20","author":"Bennetts","year":"1971","journal-title":"IEEE Transactions on Computers"},{"issue":"December","key":"10.1016\/S0141-9331(01)00112-0_BIB4","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","article-title":"State reduction in incompletely specified finite state machines","volume":"22","author":"Pfleeger","year":"1973","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB6","series-title":"Switching and Finite Automata Theory","author":"Kohavi","year":"1978"},{"issue":"August","key":"10.1016\/S0141-9331(01)00112-0_BIB7","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1109\/T-C.1975.224315","article-title":"Worst case bounds for maximal compatible subsets","author":"Rubin","year":"1975","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB8","first-page":"193","article-title":"Clique derivation algorithm for simplification of incompletely specified machines","author":"Hashizume","year":"1991","journal-title":"IEEE International Symposium on Circuits and Systems"},{"issue":"June","key":"10.1016\/S0141-9331(01)00112-0_BIB9","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1109\/43.229748","article-title":"An efficient algorithm to search for minimal closed covers in sequential machines","volume":"12","author":"Puri","year":"1993","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1049\/ip-cdt:19941228","article-title":"State merging and state splitting via state assignment: a new FSM synthesis algorithm","volume":"141","author":"Avedillo","year":"1994","journal-title":"IEEE Proceedings on Computer and Digital Techniques"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB11","first-page":"324","article-title":"The role of prime compatibles in the minimization of finite state machines","author":"Rho","year":"1992","journal-title":"IEEE International Conference on Computer-Design, ICCD-92"},{"issue":"February","key":"10.1016\/S0141-9331(01)00112-0_BIB12","first-page":"167","article-title":"Exact and heuristic algorithms for minimization of incompletely specified state machines","volume":"13","author":"Rho","year":"1994","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB13","series-title":"Logic Synthesis and Verification Algorithms","author":"Hachtel","year":"1996"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB14","first-page":"229","author":"Higuchi","year":"1995","journal-title":"Implicit prime compatible generation for minimizing incompletely specified finite state machine, Asia and South Pacific Design Automation Conference (ASP-DAC\u201995)"},{"issue":"June","key":"10.1016\/S0141-9331(01)00112-0_BIB15","article-title":"A fast state reduction algorithm for incompletely specified finite state machines","author":"Higuchi","year":"1996","journal-title":"ACM\/IEEE 33rd Design Automation Conference"},{"issue":"June","key":"10.1016\/S0141-9331(01)00112-0_BIB16","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1145\/196244.196615","article-title":"A fully implicit algorithm for exact state minimization","author":"Kam","year":"1994","journal-title":"31st ACM\/IEEE Design Automation Conference"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB17","series-title":"Synthesis of Finite State Machines: Functional Optimization","author":"Kam","year":"1997"},{"issue":"2","key":"10.1016\/S0141-9331(01)00112-0_BIB18","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/253052.253082","article-title":"Parallel logic simulation on a network of workstations using a parallel virtual machine","volume":"2","author":"Kormicki","year":"1997","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB19","first-page":"358","article-title":"Binary decision diagrams on network of workstations","author":"Ranjan","year":"1996","journal-title":"IEEE International Conference on Computer-Design, ICCD-96"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB20","series-title":"Parallel Algorithm for VLSI Computer-Aided Design","author":"Banerjee","year":"1994"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB21","series-title":"PVM: Parallel Virtual Machine-A User's Guide and Tutorial for Networked Parallel Computing","author":"Geist","year":"1994"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB22","series-title":"MPI: The Complete Reference","author":"Snir","year":"1994"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB23","series-title":"Parallel Programming with MPI","author":"Pacheco","year":"1997"},{"issue":"November","key":"10.1016\/S0141-9331(01)00112-0_BIB24","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1147\/rd.85.0537","article-title":"Derivation of maximal compatibles using Boolean algebra","author":"Marcus","year":"1964","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/S0141-9331(01)00112-0_BIB25","unstructured":"S. Yang, Logic Synthesis and Optimization Benchmarks User Guide, Version 3.0, MCNC, 1991."},{"key":"10.1016\/S0141-9331(01)00112-0_BIB26","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1109\/EDAC.1990.136708","article-title":"A new method for the state reduction of incompletely specified finite sequential machines","author":"Avedillo","year":"1990","journal-title":"Proceedings of the European Design Automation Conference, EDAC-90"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933101001120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933101001120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T14:31:10Z","timestamp":1579012270000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0141933101001120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0141933101001120"],"URL":"https:\/\/doi.org\/10.1016\/s0141-9331(01)00112-0","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}