A Logical Approach to CTL
Résumé
We introduce a notion of proof for CTL with respect to a given nite model and show some advantages of using such a notion. This also suggests to de ne a slight extension of CTL, called SCTL, where predicates can have an arbitrary arity.
Domaines
Logique en informatique [cs.LO]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...