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