Conceptual modeling in full computation-tree logic with sequence modal operator
✍ Scribed by Ken Kaneiwa; Norihiro Kamide
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 141 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0884-8173
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS * , is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree structures in cases where sequence modal operators in CTLS * are applied to tree structures. We prove a theorem for embedding CTLS * into CTL * . The validity, satisfiability, and model-checking problems of CTLS * are shown to be decidable. An illustrative example of biological taxonomy is presented using CTLS * formulas.