Premium
Binary Event String Analysis: A Compact Numerical Representation of the Event Tree
Author(s) -
Unwin Stephen D.
Publication year - 1984
Publication title -
risk analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.972
H-Index - 130
eISSN - 1539-6924
pISSN - 0272-4332
DOI - 10.1111/j.1539-6924.1984.tb00937.x
Subject(s) - event (particle physics) , diagrammatic reasoning , trie , theoretical computer science , string (physics) , computer science , representation (politics) , event tree , tree (set theory) , sequence (biology) , binary tree , tree diagram , mnemonic , data mining , algorithm , data structure , mathematics , artificial intelligence , fault tree analysis , programming language , engineering , combinatorics , law , cognitive psychology , mathematical physics , biology , genetics , psychology , quantum mechanics , political science , reliability engineering , physics , politics , bayesian probability , posterior probability
While the event tree is a useful diagrammatic aid to an appreciation of various event sequence possibilities, it is of a nature that suggests no obvious manner in which the associated probability data may be compiled as computer input. Here, we propose a complementary numerical representation of scenario possibilities which incorporates probability data in a succinct fashion. While its mnemonic properties facilitate the logical development of a system's characteristics, its compactness and unambiguity permit its utilization directly as computer input.