  The recently introduced formalism of DB-nets has brought in a new conceptual
way of modelling complex dynamic systems that equally account for the process
and data dimensions, considering local data as well as persistent,
transactional data. DB-nets combine a coloured variant of Petri nets with name
creation and management (which we call nu-CPN), with a relational database. The
integration of these two components is realized by equipping the net with
special ``view'' places that query the database and expose the resulting
answers to the net, with actions that allow transitions to update the content
of the database, and with special arcs capturing compensation in case of
transaction failure. In this work, we study whether this sophisticated model
can be encoded back into nu-CPNs. In particular, we show that the meaningful
fragment of DB-nets where database queries are expressed using unions of
conjunctive queries with inequalities can be faithfully encoded into $\nu$-CPNs
with transition priorities. This allows us to directly exploit state-of-the-art
technologies such as CPN Tools to simulate and analyse this relevant class of
DB-nets.
