A temporal operator states how a proposition behaves across time in a temporal logic. In linear temporal logic, means that holds at the next position, that it holds eventually, and that it holds at every later position, including the current one.
The binary strong until operator requires a future position where holds and requires at all earlier positions. Thus expresses that every request eventually gets a response. The temporal operators distinguish such behavior from an ordinary Boolean condition evaluated at one instant. Branching-time logics additionally quantify over possible execution paths.
In linear temporal logic, means . Thus it permits the left operand to hold forever without the right operand ever becoming true, unlike strong until.
In linear temporal logic, holds at position exactly when some satisfies and every position with satisfies . The witness must exist. The case imposes no condition on .
The linear temporal logic operator , true at position of a path in a transition system exactly when is true at position . Thus tests two positions ahead.
Articles by others on the same topic
There are currently no matching articles.