Cycle detection in computation tree logic
We introduce Cycle-CTL, an extension of CTL with cycle quantifications that are able to predicate over cycles. The introduced logic turns out to be very expressive. Indeed, we prove that it strictly extends CTL and is orthogonal to μCalculus. We also give an evidence of its usefulness by providing f...
| Автори: | , , , , |
|---|---|
| Формат: | Journal article |
| Опубліковано: |
Elsevier
2018
|