Temporal logic CTL + PROLOG
β Scribed by Tong Gao Tang
- Publisher
- Springer Netherlands
- Year
- 1989
- Tongue
- English
- Weight
- 631 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0168-7433
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An adequate set of temporal connectives for CTL is a subset of the logic's temporal connectives that is sufficient to express equivalents for all CTL formulas. In this paper, a characterization of all such adequate sets is presented. Specifically, it is shown that a subset of CTL's temporal connect
In this section, we present a brief introduction to five temporal logic-based programming languages: Chronolog, F-Limette, Concurrent MetateM, Tempura and Tokio. While a variety of verification systems based upon temporal logics have been produced, particularly involving model-checking techniques, t