Correctness Notions for Petri Nets with Identifiers

DOI10.3233/fi-242169arXiv2212.07363OpenAlexW4391346657MaRDI QIDQ6189321

Marco Montali, Jan Martijn E. M. van der Werf, Andrey Rivkin, Artem Polyvyanyy

Publication date: 8 February 2024

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

verificationinformation systemdata correctnessresource correctness

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• 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
• Parallel program schemata
• Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
• Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
• Forward Analysis for Petri Nets with Name Creation
• Understanding Petri Nets
• Business Process Modeling Using Petri Nets
• Discovering Object-centric Petri Nets
• Inferring Unobserved Events in Systems with Shared Resources and Queues
• Resource Bisimilarity in Petri Nets is Decidable
• Discovering Block-Structured Process Models from Event Logs - A Constructive Approach
• Applications and Theory of Petri Nets 2005

This page was built for publication: Correctness Notions for Petri Nets with Identifiers