As in the subject. More context is that I have some requirements encoded as separate actions
and multiple actions are allowed only if they have the same final state.
I would like to check this in one invariant formula. Is this expressible in TLA+?
Any of the available action operators seems to apply to my case.