Table 6:
CP semantics in LTL (subscripts
C
and
E
stand for condition and event, resp.).
CP Class
Semantics in LTL
(1)
AtLeastOne
C
𝑃
1
∨
𝑃
2
∨
⋯
∨
𝑃
𝑛
(2)
AtLeastOne
E
(
¬
𝑃
1
∧
⋯
∧
¬
𝑃
𝑛
)
∧
(
(
¬
𝑃
1
∧
⋯
∧
¬
𝑃
𝑛
)
𝑈
(
𝑃
1
∨
⋯
∨
𝑃
𝑛
)
)
(3)
Parallel
C
𝑃
1
∧
𝑃
2
∧
⋯
∧
𝑃
𝑛
(4)
Parallel
E
(
¬
𝑃
1
∧
¬
𝑃
2
∧
⋯
∧
¬
𝑃
𝑛
)
∧
(
(
¬
𝑃
1
∧
¬
𝑃
2
∧
⋯
∧
¬
𝑃
𝑛
)
𝑈
(
𝑃
1
∧
𝑃
2
∧
⋯
∧
𝑃
𝑛
)
)
(5)
Consecutive
C
𝑃
1
∧
𝑋
(
𝑃
2
∧
𝑋
(
⋯
∧
𝑋
(
𝑃
𝑛
)
)
⋯
)
)
)
(6)
Consecutive
E
(
¬
𝑃
1
∧
¬
𝑃
2
∧
⋯
∧
¬
𝑃
𝑛
)
∧
(
(
¬
𝑃
1
∧
¬
𝑃
2
∧
⋯
∧
¬
𝑃
𝑛
)
𝑈
(
(
𝑃
1
∧
¬
𝑃
2
∧
¬
𝑃
3
∧
⋯
∧
¬
𝑃
𝑛
)
∧
𝑋
(
(
𝑃
2
∧
¬
𝑃
3
∧
⋯
∧
¬
𝑃
𝑛
)
∧
⋯
∧
𝑋
(
𝑃
𝑛
)
⋯
)
)
(7)
Eventual
C
𝑃
1
∧
(
¬
𝑃
2
𝑈
(
𝑃
2
∧
⋯
∧
(
¬
𝑃
𝑛
𝑈
𝑃
𝑛
)
)
⋯
)
(8)
Eventual
E
(
¬
𝑃
1
∧
⋯
∧
¬
𝑃
𝑛
)
∧
(
(
¬
𝑃
1
∧
⋯
∧
¬
𝑃
𝑛
)
𝑈
(
𝑃
1
∧
(
(
¬
𝑃
2
∧
⋯
∧
¬
𝑃
𝑛
)
𝑈
(
𝑃
2
∧
(
⋯
∧
(
𝑃
𝑛
−
1
∧
(
¬
𝑃
𝑛
𝑈
𝑃
𝑛
)
)
⋯
)
)
)
)
)
(9)
Strict Eventual
C
𝑃
1
∧
𝑋
(
¬
𝑃
2
𝑈
(
𝑃
2
∧
⋯
∧
𝑋
(
¬
𝑃
𝑛
𝑈
𝑃
𝑛
)
)
⋯
)
(10)
Strict Eventual
E
(
¬
𝑃
1
∧
⋯
∧
¬
𝑃
𝑛
)
∧
(
(
¬
𝑃
1
∧
⋯
∧
¬
𝑃
𝑛
)
𝑈
(
𝑃
1
∧
¬
𝑃
2
∧
⋯
∧
¬
𝑃
𝑛
∧
(
(
¬
𝑃
2
∧
⋯
∧
¬
𝑃
𝑛
)
𝑈
(
𝑃
2
∧
¬
𝑃
3
∧
⋯
∧
¬
𝑃
𝑛
∧
(
⋯
∧
(
𝑃
𝑛
−
1
∧
¬
𝑃
𝑛
∧
(
¬
𝑃
𝑛
𝑈
𝑃
𝑛
)
)
⋯
)
)
)
)
)