This paper introduces a formalism to model task execution in distributed computing systems. The proposed formalism, based on a partial order semantic model, extends standard temporal logic to specify task execution in distributed systems. It allows derivation of a set of inequalities sufficient to ensure deadline constraints. Task execution in an onboard computer is modeled and verified using the developed formalism. Extensions for task refinement are also presented