| 
|
Quote: specify fair termination using Streett automata; fair non-termination iff either first Boolean succeeds only finitely often, or the second succeeds infinitely often
Topic:
safety, liveness, and system properties
Quotation Skeleton
we first define a minimal language for specification … The fairness constraints are given as pairs of … a pattern. … An example … : "whenever function 'foo' is called infinitely often … path satisfies a fairness constraint if and only … finitely often or the second Boolean expression succeeds … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: safety, liveness, and system properties (22 items)