6

Here is how I think Erlang works. I believe Akka is very similar. Each process has a single mailbox. Messages are put into the receiver's mailbox by the sender, and fetched by the receiver using pattern matching. This matching process can change message ordering in the sense that the oldest message in a mailbox may not match, but a younger one does. In this ...


3

There are several possible semantics for asynchronous message passing, so there isn't a single answer to this question. It depends how the scheduler works. From a theoretical perspective, the simplest model (for some version of simple) is to not have a scheduler. Once a message has been emitted, it may be received at any time when the receiver is ready. All ...


2

Since the processes can only receive message from their adjacent neighbors, we could first have the all the processes propagate the maximum values through the grid in downward direction in parallel. Similar to a one dimensional array in which we have to find the maximum value. But here, we do that in parallel for n columns of processes. After this, the ...


1

The most mathematical paper I have seen on Behavior Trees is How Behavior Trees Modularize Hybrid Control Systems and Generalize Sequential Behavior Compositions, the Subsumption Architecture and Decision Trees. It is the only paper I have seen that defines Behavior Trees as a tuple e.g. A BT is a three-tuple $T_i = \{f_i, r_i, \Delta t\}$ Since Behavior ...


1

If you're looking for a single model that describes all relevant aspects of your system, you'll have a hard time. And building the model will take as much effort as implementing the system itself, if not more. Therefore, break the system down into different aspects, and consider different modelling techniques for each. Examples for aspects might be: The ...


Only top voted, non community-wiki answers of a minimum length are eligible