Modelling events and random generators of events seems
easily feasible. And so is modelling queues with just a lenght
counter.
Modelling tokens with identifier is possible. Modelling queues
maintaining tokens is still possible for max fixed lenght
queues, but is quite complicated and not efficient.
Modelling dynamic queues (with not fixed max lenght) is not
possible.
Question: which kind of support for basic data structures
(available to user functions) should be inserted in the runtime?
(see also 1323952 array and struct).
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Logged In: YES
user_id=1311864
Found one: the case study used at the simulation course
here at Pisa. An UML modelling attempt was already done.
Logged In: YES
user_id=1311864
Modelling events and random generators of events seems
easily feasible. And so is modelling queues with just a lenght
counter.
Modelling tokens with identifier is possible. Modelling queues
maintaining tokens is still possible for max fixed lenght
queues, but is quite complicated and not efficient.
Modelling dynamic queues (with not fixed max lenght) is not
possible.
Question: which kind of support for basic data structures
(available to user functions) should be inserted in the runtime?
(see also 1323952 array and struct).