Package ca.uqac.lif.cep.ltl
Temporal operators and quantifiers have processors in two versions: Boolean and Troolean.
Boolean processors are called Globally,
Eventually
Until, Next,
and first-order quantifiers.
If a0 a1
a2 … is an input trace, the processor Globally
produces an output trace b0 b1
b2 … such that bi = false if and only
there exists j ≥ i such that bj = false. In other
words, the i-th output event is the Boolean verdict of evaluating
G φ on the input trace, starting at the i-th event.
Troolean processors are called Always,
Sometime,
UpTo, After,
Every and Some.
If a0 a1
a2 … is an input trace, the processor Always
produces an output trace b0 b1
b2 … such that bi = false if there exists
j ≤ i such that bj = false, and "?" (the
"inconclusive" value of LTL3) otherwise. In other
words, the i-th output event is the Boolean verdict of evaluating
G φ on the input trace, after reading i events.
- Author:
- Sylvain Hallé
-
ClassDescriptionTroolean implementation of the LTL X operatorTroolean implementation of the LTL G operatorBoolean implementation of the LTL F processorTroolean implementation of the universal first-order quantifier.Boolean implementation of the existential first-order quantifier.Boolean implementation of the universal first-order quantifier.Boolean implementation of the LTL G processorCasts a Boolean value into a Troolean value, by converting (Boolean) true into (Troolean) inconclusive.Dummy main fileBoolean implementation of the LTL X processorCasts a Boolean value into a Troolean value, by converting (Boolean) false into (Troolean) inconclusive.Troolean implementation of the existential first-order quantifier.Troolean implementation of the LTL F processorImplementation of a three-valued logic.The three possible values of a TrooleanCasts an object into a Troolean valueBoolean implementation of the LTL U processorTroolean version of the LTL U operator