rakhimov / scram Goto Github PK

Implement m out of n OR logic gate.

Implement conditioning event that can be used with Priority And and Inhibit gates.

Requires development of a dynamic tree. This gate development might be followed by other dynamic gates, such as sequence (SEQ).

Implement NOT OR gate

Instead of Top/Intermediate/Primary events, the tree is composed of Nodes of Gates and Primary Events.

Time and space comparisons

• The implemented algorithm
• Industry standards

Add processing for XML input arbitrary 'label' description for elements, such as fault trees, gates, events.

Events of a transfer sub tree can reference events from a main top tree, which is illegal.

Make the fault tree generator output XML file instead of the current custom format.

Primary events may use names of Intermediate events, and vice versa. This should not be allowed.
Currently, this bug causes a circular inclusion upon set expansion and leads to an infinite loop.

Initial minimalistic GUI setup.

• CMake setup for Qt
• Qt GUI coding style, standards, and best practices
• GUI documentation and references (Human interface guidelines)
• Retire the Graphviz-based visualization approach
• Very basic main window
• CI and automated tests

• Provide cmake instructions to build and install with tests.
• Create a python script to make the installation easier.
• Update installation instructions

Implement Exclusive OR gate

• Algorithm
• FTA Equation generation
• RNGs and Distributions
• Implementation
• Input by a user
• Custom distributions by a user (Linear extrapolations between points.)
• Uncertainty analysis
• Report the analysis results for top event

Short description of fault tree, event tree, ccf, and other analysis for general users.

Measure test coverage of the code.

Setup CI.

Introduce cut-off probability for cut sets that should be included into total probability calculations.

Provide validation and analysis of a transfer sub tree without inclusion into a main tree.

Move documentation from plain text to rst.

Report time taken by the most demanding functions, such as minimal cut set generation and probability calculations.

Manuals, features, cost, algorithms, user-friendliness:
OpenFTA
Isograph
RiskMan

Provide a capability to accept failure rates and time length in order to calculate failure probabilities.

It must report that there are no cut sets for the given limit order.

Implement NOT gate.

Re-initialization of a primary event with a different type should throw an error.

Set up a standard output format. Make sure columns are aligned properly.

Implement the Min-Cut-Upper Bound Approximation for probability calculations from minimal cut sets.

Provide graphing instructions for a transfer sub-tree.

Clean redundant code and apply styles: Google Style, PEP 8

Add support for 'attributes' element for fault trees, gates, events, and other objects.

Develop more incorrect input files and include them in the python script and tests.

Assign indexes to events and analyze using indexes instead of string names.

• XML input based on OpenPSA MEF
• RelaxNG Validation
• Initial parsing
• Documentation

Provide unit tests for corner cases and integration tests between modules.

Move all the current input files to xml format.

Automate output comparison for benchmark inputs.

Documentation pages on gh-pages.

Provide a short description of the model exchange format.

Display version information of the executable and dependencies upon request.

Incorporate Doxygen API output into Documentation web pages.

Implement NOT AND gate

Wrong type command line arguments make scram to exit with an exception instead of given a proper message to the caller.

• Minimal Cut Set Generation
• Probability Calculations

One node sub-tree graphing causes an error. Should be only a warning of non-graphability.

Provide static code analysis.