  In this paper we focus on the problem of decomposing a global Signal Temporal
Logic formula (STL) assigned to a multi-agent system to local STL tasks when
the team of agents is a-priori decomposed to disjoint sub-teams. The predicate
functions associated to the local tasks are parameterized as hypercubes
depending on the states of the agents in a given sub-team. The parameters of
the functions are, then, found as part of the solution of a convex program that
aims implicitly at maximizing the volume of the zero level-set of the
corresponding predicate function. Two alternative definitions of the local STL
tasks are proposed and the satisfaction of the global STL formula is proven
when the conjunction of the local STL tasks is satisfied.
