2000 character limit reached
Soundness in Object-centric Workflow Petri Nets
Published 30 Dec 2021 in cs.LO, cs.AI, and cs.FL | (2112.14994v1)
Abstract: Recently introduced Petri net-based formalisms advocate the importance of proper representation and management of case objects as well as their co-evolution. In this work we build on top of one of such formalisms and introduce the notion of soundness for it. We demonstrate that for nets with non-deterministic synchronization between case objects, the soundness problem is decidable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.