Nets-within-nets through the lens of data nets

DOI10.1007/978-3-032-09524-4_11MaRDI QIDQ7294403zbMATH OpenFDO

Authors Francesco Di Cosmo, Soumodev Mal, Tephilla Prince

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-09524-4_11

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A survey of decidability results for elementary object systems
• A well-structured framework for analysing Petri net extensions
• Analysing adaption processes of Hornets
• Decidability and complexity of Petri nets with unordered data
• scientific article; zbMATH DE number 1515290 (Why is no real title available?)
• scientific article; zbMATH DE number 1522994 (Why is no real title available?)
• Lectures on Concurrency and Petri Nets
• Multiply-recursive upper bounds with Higman's lemma
• Nets with tokens which carry data
• Ordinal recursive complexity of unordered data nets
• The complexity of coverability in -Petri nets
• The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets
• Well-structured transition systems everywhere!

This page was built for publication: Nets-within-nets through the lens of data nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294403)