A Practical Introduction to PSL

The remainder of the temporal layer is syntactic sugar. In other words, it does not add expressive power, and every piece of syntactic sugar can be defined in terms of the basic FL operators presented above. The syntactic sugar is defined below.
| Note | The definitions given here do not necessarily represent the most effcient implementation. In some cases, there is an equivalent syntactic sugaring, or a direct implementation, that is more effcient. |
Let i, j, k, and l be integer constants such that i ? 0, j ? i, k ? 1, l ? k. Then, additional SERE operators can be viewed as abbreviations of the basic SERE operators defined above, as follows, where b denotes a boolean expression, and r denotes a SERE:
r[+]
= r; r[*]
r[*0]
= [*0]
r[* k]
![]()
r[* i j]
r[* i] r[* j]
r[* i ]
r[* i]; r[*]
r[* i]
r[*0] r[* i]
r[* ]
r[*0 ]
[+]
true[+]
[*]
true[*]
[* i]
true[* i]
[* i j]
true[* i j]
[* i ]
true[* i ]
[* i]
true[* i]
[* ]
true[* ]
b[= i] ![]()