From DB-nets to Coloured Petri Nets with Priorities

DOI10.1007/978-3-030-21571-2_24arXiv1904.00058OpenAlexW2952037556MaRDI QIDQ6144227

Andrey Rivkin, Marco Montali

Publication date: 29 January 2024

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.00058

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model checking Petri nets with names using data-centric dynamic systems
• Decidability and complexity of Petri nets with unordered data
• First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus
• A Fluent Calculus Semantics for ADL with Plan Constraints
• Coloured Petri Nets

This page was built for publication: From DB-nets to Coloured Petri Nets with Priorities