To assist in the design and the analysis of complex discrete systems exhibiting concurrency, formal techniques are needed which comprehend a hierarchical representation of such systems and a rigorous analysis of their properties. This paper presents the main axiom and definitions of uninterpreted models named discrete nets, and demonstrates by examples the usefulness of proposed formalization.