Fluidization is an appealing relaxation technique based on the removal of integrality constraints in order to ease the analysis of discrete Petri nets. The result of fluidifying discrete Petri nets are the so called Fluid or Continuous Petri nets. As with any relaxation technique, discrepancies among the behaviours of the discrete and the relaxed model may appear. Moreover, such discrepancies may have a comparatively bigger effect when the population of the system, the marking in Petri net terms, is “relatively” small. This paper proposes two complementary approaches to obtain a better fluid approximation of discrete Petri nets. The first one focuses on untimed systems and is based on the addition of places that are implicit in the untimed discrete system but not in the continuous. The idea is to cut undesired spurious solutions whose existence worsens the fluidization. The second one focuses on a particular situation that can severely affect the quality of fluidization in timed systems. Namely, such a situation arises when the enabling degree of a transition is equal to 1. This last approach aims to alleviate such a state of affairs, which is termed the bound reaching problem, on systems under infinite servers semantics
