180 likes | 293 Views
CTL* Semantics. CS 586. E: Exists a path. s. NOT a model of. E: Exists a path. s. A: All paths. s. NOT a model of. A: All paths. s. F: Eventually. s. EF: Along some path, eventually. s. NOT a well-formed problem. AF: Along every path, eventually. s. NOT a model of.
E N D
CTL* Semantics CS 586
E: Exists a path s NOT a model of
A: All paths s NOT a model of
EF: Along some path, eventually s NOT a well-formed problem
AF: Along every path, eventually s NOT a model of
EGAF s there exists a path, on which it is always true that…
EGAF s there exists a path, on which it is always true that… For all paths, eventually red.
EGAF always means true for all states on the path. Get AF red for s. s there exists a path, on which it is always true that… For all paths, eventually red.
EGAF always means true for all states on the path. Get AF red for s. s there exists a path, on which it is always true that… For all paths, eventually red.
EGAF always means true for all states on the path. Get AF red for s. Get AF red for t. s there exists a path, on which it is always true that… For all paths, eventually red. t
EGAF always means true for all states on the path. Get AF red for s. Get AF red for t. Get AF red for u. s there exists a path, on which it is always true that… For all paths, eventually red. t u
EGAF always means true for all states on the path. Get AF red for s. Get AF red for t. Get AF red for u. Get AF red for v. s there exists a path, on which it is always true that… For all paths, eventually red. t u v
Some Examples • It always gets cloudy before it rains • Bad things never happen • Its possible to have your cake and eat it too. • I will eventually grade your homework