Hi Mariusz,I imagine you'd like to write something likeNext == \E ids \in SUBSET TaskID : \A id \in ids : Task(id)In practice, this is not going to work, in particular because your state variables are probably arrays and the definition of Task contains expressions of the formvar' = [var EXCEPT ![id] = ...]You can try to work around this problem by writingvar[id]' = ...in the definition of Task and definingNext ==/\ var' \in [TaskID -> ...]/\ \E ids \in SUBSET TaskID :/\ \A id \in ids : Task(id)/\ \A id \in TaskID \ ids : UNCHANGED var[id]but TLC will not handle that very well because it will generate all possible type-correct values for var' and then reduce those to the few successor values that are actually possible. Perhaps Apalache would be able to handle such definitions better because it doesn't explicitly construct states one by one. If you are mainly interested in verification using TLC, I think that your solution will work best.StephanOn 22 Oct 2020, at 13:25, Mariusz Ryndzionek <mrynd...@xxxxxxxxx> wrote:I'm writing a simple spec for a task scheduler. Most of the spec I've seen do something like this:Task(task_id) == /* handles one task at a timeNext == \E task_id \in TaskID : Task(task_id) ...This models/describes a situation where each task gets activatedbone at a time. I would like to model a situation where any combination of tasks can become active at any instant. Something like this seems to work:Tasks(task_ids) == /* handles multiple tasks at a timeNext == \E task_ids \in SUBSET TaskID \ {{}} : Tasks(task_ids)However is there a maybe another way to accomplish this? Preferably a way that would not require to turn Task(taks_id) into Tasks(task_ids).Regards,Mariusz--
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+u...@xxxxxxxxxxxxxxxx.
To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/aaef82d5-f62e-4e50-b87c-15aad19c6cc9n%40googlegroups.com.