Open jabowery opened 1 week ago
I hadn't come across TLinda until now! The minimal information that I could find mentions that the tuples in TLinda need to be pre-declared.
Can you provide any pointer to the papers or docs that describe the TLinda syntax and semantics?
As a general rule, I prefer to keep espace true to the original simple semantics of Linda.
However, it may be possible to create a separate experimental project that implements the TLinda semantics using the espace application.
TLinda provides operations Co, NotCo, AntiCo, and AntiNotCo with these semantics:
TRUE ALL UNTIL Co U, ... ,V Block UNTIL ALL tuples simultaneously present TRUE NONE UNTIL AntiCo U,... ,v Block UNTIL NO tuples are present FALSE ALL UNTIL NotCo U, ... ,v Block UNTIL SOME tuples simultaneously NOT present FALSE NONE UNTIL AntiCo U, .. .,v Block UNTIL ALL tuples are simultaneously NOT present
TRUE ALL WHEN AntiNotCo U,,...V Block WHEN ALL tuples are simultaneously present TRUE NONE WHEN Co U, ... , V Block WHEN NO tuples are present FALSE ALL WHEN NotCo U , .. ,v Block WHEN ALL tuples are simultaneously NOT present FALSE NONE WHEN Co U, ... , V Block WHEN NO tuples are simultaneously NOT present
Would you recommend the main or the experimental branch to extend espace for TLinda?