Fair computational tree logic

Fair computational tree logic is conventional computational tree logic studied with explicit fairness constraints. == Weak fairness / justice == This declares conditions such as all processes execute infinitely often.

Source: Wikipedia — Fair computational tree logic (CC BY-SA 4.0)

Fair computational tree logic

Fair computational tree logic is conventional computational tree logic studied with explicit fairness constraints. == Weak fairness / justice == This declares conditions such as all processes execute infinitely often.

This neuron ends here.

Source: Wikipedia "Fair computational tree logic" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy