{logic.modelChecking} CTL
Here yet another nice introduction to model checking:
http://www.cs.utexas.edu/users/wahl/intro-modelChecking.pdf
CTL (Computational Tree Logic) is a branching-time logic. All of our daily actions can actually satisfy a correctness statement in CTL. For example,
AG ~(arrogance) means "avoid arrogance";
AG (self-esteem) means "maintain self-esteem";
EG ~(arrogance) means "try to avoid arrogance";
EG (self-esteem) means "try to maintain self-esteem";
AF (financial independence) means "reach financial independence"; and
EF (Damavand peak) means "try to reach Damavand peak".
http://www.cs.utexas.edu/users/wahl/intro-modelChecking.pdf
CTL (Computational Tree Logic) is a branching-time logic. All of our daily actions can actually satisfy a correctness statement in CTL. For example,
AG ~(arrogance) means "avoid arrogance";
AG (self-esteem) means "maintain self-esteem";
EG ~(arrogance) means "try to avoid arrogance";
EG (self-esteem) means "try to maintain self-esteem";
AF (financial independence) means "reach financial independence"; and
EF (Damavand peak) means "try to reach Damavand peak".
1 Comments:
Very pretty site! Keep working. thnx!
»
By Anonymous, At 8/15/2006 6:29 PM
Post a Comment
Subscribe to Post Comments [Atom]
<< Home