作者: Bart. Cappelle , Etienne. E. Kerre
DOI: 10.1007/978-1-4615-5473-8_22
关键词: Function (mathematics) 、 Computer science 、 Possibility theory 、 Computability 、 Complete information 、 Theoretical computer science 、 Structure function 、 Dual (category theory) 、 Reliability (statistics) 、 Discrete mathematics 、 Component (UML)
摘要: The mathematical representation of human behaviour and incomplete information is one the most important challenges in nowadays reliability modelling. Only few papers discuss algorithms to compute possibilistic system from component reliabilities. In this paper, we present an algorithm approximate dual function a represented by n-ary structure