Maximality-based labeled transition system model is a model which expresses, in a natural way, maximality semantics of concurrent systems. In this paper, we present intuitively and motivate the maximality semantics. Moreover, we present some results around expressing true-concurrent semantics of P/T Petri nets in terms of maximality-based labeled transition systems. First, an operational semantics for P/T Petri nets allowing interpreting a Petri net in terms of maximality- based labeled transition system is proposed. As effect, bisimulation relations of maximality, defined on maximality-based labeled transition systems, are extended to Petri nets. Then, we explore results of two interesting reduction techniques, namely the aggregation of transitions and reduction based on α-equivalence relation.