SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

CTL* Semantics

maik avatar
maik
18 diapositives · 316 Views · Aug 29, 2014

This document delves into the semantics of path existence in temporal logic, particularly focusing on various modalities like eventually (AF) and always (EG) across multiple paths. It examines the implications of these modalities in determining whether certain conditions hold true under specified circumstances. Through a series of examples, such as "It always gets cloudy before it rains" and "Bad things never happen," the discussion underscores myriads of logical constructs in designing models that represent temporal behaviors consistently in both finite and infinite states.

CTL* Semantics - slide 1
01 / 18CTL* Semantics
1 / 17

Télécharger la présentation

CTL* Semantics
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  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