ALGORITHM COMPARING BINARY STRING PROBABILITIES IN COMPLEX STOCHASTIC BOOLEAN SYSTEMS USING INTRINSIC ORDER GRAPH

DOI10.1142/S0219525907001136MaRDI QIDQ5386770zbMATH OpenOpenAlexFDO

Authors

Publication date 14 May 2008

Published in Advances in Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219525907001136

zbMATH Keywords

algorithmbinary string probabilitiescomplex stochastic Boolean systemintrinsic orderlexicographic order

Mathematics Subject Classification ID

Large-scale systems (93A15) Stochastic systems in control theory (general) (93E03)

Recommendations

• A Picture for Complex Stochastic Boolean Systems: The Intrinsic Order Graph
• A New Algorithm for Complex Stochastic Boolean Systems
• Intrinsic ordering, combinatorial numbers and reliability engineering
• scientific article; zbMATH DE number 2087934
• A combinatorial method for the evaluation of probabilities of complex Boolean functions

Cites work

• A Picture for Complex Stochastic Boolean Systems: The Intrinsic Order Graph
• Foundational Issues in Reliability and Risk Analysis

Cited in

(4)

• Intrinsic ordering, combinatorial numbers and reliability engineering
• scientific article; zbMATH DE number 2087934 (Why is no real title available?)
• A Picture for Complex Stochastic Boolean Systems: The Intrinsic Order Graph
• A New Algorithm for Complex Stochastic Boolean Systems

This page was built for publication: ALGORITHM COMPARING BINARY STRING PROBABILITIES IN COMPLEX STOCHASTIC BOOLEAN SYSTEMS USING INTRINSIC ORDER GRAPH

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