An algorithm for hazard-free minimization of incompletely specified switching function

DOI10.1016/0020-0190(94)90135-XMaRDI QIDQ1336745zbMATH OpenOpenAlexFDO

Authors Md. Mozammel Huq Azad Khan

Publication date 3 November 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)90135-x

zbMATH Keywords

algorithmfault toleranceconsensus operationnetwork minimization

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12)

Recommendations

• Absolute minimization of completely specified switching functions
• A New Technique for the Fast Minimization of Switching Functions
• scientific article; zbMATH DE number 3924688
• scientific article; zbMATH DE number 1488904
• Algorithms for optimal control of stochastic switching systems
• Minimization of the number of switchings between optimal continuous-discrete controlled processes
• A numerical algorithm for optimal control problems with switching costs
• Optimal switching sequence of a class of switched systems with parameter uncertainty
• A limited-feedback approximation scheme for optimal switching problems with execution delays
• scientific article; zbMATH DE number 6310689

Cited in

(2)

• Elimination of static and dynamic hazards for multiple input changes in combinational switching circuits
• scientific article; zbMATH DE number 3256238 (Why is no real title available?)

This page was built for publication: An algorithm for hazard-free minimization of incompletely specified switching function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336745)