Abstract: In an example, a method can include determining, at a first inter-partition messenger, a message type for a message generated by a first application. The first inter-partition messenger and the first application can reside on a first virtual machine. The method can include identifying, at the first inter-partition messenger, a second application that is to receive the message based on the message type and message subscription data, generating, at the first inter-partition messenger, message routing data for routing of the message from the first virtual machine to the second virtual machine, causing, at the first inter-partition messenger, the message to be routed from the first virtual machine to the second virtual machine based on the message routing data, and receiving, at the second inter-partition messenger, the message for use thereof by the second application. The second inter-partition messenger and the second application can reside on the second virtual machine.

Abstract: A system and method for calculating worst case execution times for actions in a process that is partitioned into a number of sub-processes that perform certain ones of the actions and operate on their own partition schedule independent of the other partitions. The method includes providing a unified modeling language (UML) activity diagram including the actions in the process, identifying each action in the diagram, determining each possible processing path for the actions in the process, assigning each action in each path to one of the sub-processes in the partitions, determining the time that each action will take through each path based on the partition schedule, and integrating the times for performing the actions in each of the paths. The method reports a longest time for performing the process along each path based on the integration of the times.

Abstract: A system and method for calculating worst case execution times for actions in a process that is partitioned into a number of sub-processes that perform certain ones of the actions and operate on their own partition schedule independent of the other partitions. The method includes providing a unified modeling language (UML) activity diagram including the actions in the process, identifying each action in the diagram, determining each possible processing path for the actions in the process, assigning each action in each path to one of the sub-processes in the partitions, determining the time that each action will take through each path based on the partition schedule, and integrating the times for performing the actions in each of the paths. The method reports a longest time for performing the process along each path based on the integration of the times.

Abstract: In an example, a method can include determining, at a first inter-partition messenger, a message type for a message generated by a first application. The first inter-partition messenger and the first application can reside on a first virtual machine. The method can include identifying, at the first inter-partition messenger, a second application that is to receive the message based on the message type and message subscription data, generating, at the first inter-partition messenger, message routing data for routing of the message from the first virtual machine to the second virtual machine, causing, at the first inter-partition messenger, the message to be routed from the first virtual machine to the second virtual machine based on the message routing data, and receiving, at the second inter-partition messenger, the message for use thereof by the second application. The second inter-partition messenger and the second application can reside on the second virtual machine.