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...
Main Authors: | Fontaine, G, Mogavero, F, Murano, A, Perelli, G, Sorrentino, L |
---|---|
Format: | Journal article |
Published: |
Elsevier
2018
|
Similar Items
-
Cycle detection in computation tree logic
by: Fontaine, G, et al.
Published: (2016) -
Binding forms in first-order logic
by: Mogavero, F, et al.
Published: (2015) -
Reasoning about Strategies: on the Satisfiability Problem
by: Mogavero, F, et al.
Published: (2017) -
On the counting of strategies
by: Malvone, V, et al.
Published: (2016) -
Hierarchical cost-parity games
by: Bozzelli, L, et al.
Published: (2017)