English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

The recently introduced formalism of DB-nets has brought in a new conceptualway of modelling complex dynamic systems that equally account for the processand data dimensions, considering local data as well as persistent,transactional data. DB-nets combine a coloured variant of Petri nets with namecreation and management (which we call nu-CPN), with a relational database. Theintegration of these two components is realized by equipping the net withspecial ``view'' places that query the database and expose the resultinganswers to the net, with actions that allow transitions to update the contentof the database, and with special arcs capturing compensation in case oftransaction failure. In this work, we study whether this sophisticated modelcan be encoded back into nu-CPNs. In particular, we show that the meaningfulfragment of DB-nets where database queries are expressed using unions ofconjunctive queries with inequalities can be faithfully encoded into $\nu$-CPNswith transition priorities. This allows us to directly exploit state-of-the-arttechnologies such as CPN Tools to simulate and analyse this relevant class ofDB-nets.

From DB-nets to Coloured Petri Nets with Priorities (Extended Version)