1 / 18

CTL* Semantics

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.

maik
Download Presentation

CTL* Semantics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CTL* Semantics CS 586

  2. E: Exists a path s NOT a model of

  3. E: Exists a path s

  4. A: All paths s NOT a model of

  5. A: All paths s

  6. F: Eventually s

  7. EF: Along some path, eventually s NOT a well-formed problem

  8. AF: Along every path, eventually s NOT a model of

  9. AF: Along every path, eventually s

  10. EGAF s there exists a path, on which it is always true that…

  11. EGAF s there exists a path, on which it is always true that… For all paths, eventually red.

  12. 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.

  13. 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.

  14. 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

  15. 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

  16. 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

  17. s

  18. 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

More Related