Preserving DE semantics at runtime can be challenging, since the global, consistent notion of time may lead to a total ordering of execution in a distributed system, an unnecessary waste of resources. A dependency analysis framework is presented to allow out of order processing of events without compromising determinism and without requiring backtracking. The key idea is that if two events have independent affects, formally defined through causality analysis, then they can be processed in any order. As a result, if the earlier event is delayed due to communication, processing of the later event does not need to be blocked.
General event triggered real-time systems with multiple shared resources are not amenable to compile-time feasibility analysis. However, when the discrete activities can come in predictable patterns, real-time scheduling theories are applicable to many PTIDES models. This dissertation studies a sufficient condition for a PTIDES model to be feasible when the inputs to a PTIDES model are sporadic, i.e. when there is a minimum interval between any two consecutive events of the same input.