English
Related papers

Related papers: The complexity of soundness in workflow nets

200 papers

Workflow nets are a well-established mathematical formalism for the analysis of business processes arising from either modeling tools or process mining. The central decision problems for workflow nets are $k$-soundness, generalised…

Logic in Computer Science · Computer Science 2022-06-07 Michael Blondin , Filip Mazowiecki , Philip Offtermatt

Workflow nets are a well-established variant of Petri nets for the modeling of process activities such as business processes. The standard correctness notion of workflow nets is soundness, which comes in several variants. Their decidability…

Formal Languages and Automata Theory · Computer Science 2025-03-07 Michael Blondin , Alain Finkel , Piotr Hofman , Filip Mazowiecki , Philip Offtermatt

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…

Logic in Computer Science · Computer Science 2022-01-03 Irina A. Lomazova , Alexey A. Mitsyuk , Andrey Rivkin

The last decade has witnessed an increasing transformation in the design, engineering, and mining of processes, moving from a pure control-flow perspective to more integrated models where also data and decisions are explicitly considered.…

Logic in Computer Science · Computer Science 2018-04-09 Massimiliano de Leoni , Paolo Felli , Marco Montali

We present a method for hierarchically generating sound workflow nets by substitution of nets with multiple inputs and outputs. We show that this method is correct and generalizes the class of nets generated by other hierarchical…

Formal Languages and Automata Theory · Computer Science 2013-10-02 Jacek Sroka , Jan Hidders

In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute the most important conformance checking technique. We study the algorithmic complexity of computing…

Formal Languages and Automata Theory · Computer Science 2026-03-06 Christopher T. Schwanen , Wied Pakusa , Wil M. P. van der Aalst

In this paper, we propose a compositional approach to constructing correct formal models of information systems from correct models of interacting components. Component behavior is represented using workflow nets - a class of Petri nets.…

Logic in Computer Science · Computer Science 2022-08-03 Luca Bernardinello , Irina Lomazova , Roman Nesterov , Lucia Pomello

This paper introduces negotiations, a model of concurrency close to Petri nets, with multi-party negotiations as concurrency primitive. We study two fundamental analysis problems. The soundness problem consists in deciding if it is always…

Logic in Computer Science · Computer Science 2016-12-26 Joerg Desel , Javier Esparza , Philipp Hoffmann

Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an…

Logic in Computer Science · Computer Science 2023-06-22 Giorgi Japaridze

A process model is called sound if it always terminates properly and each model activity can occur in a process instance. Conducting soundness verification right after process design allows one to detect and eliminate design errors in a…

Logic in Computer Science · Computer Science 2025-02-18 Nikolai M. Suvorov , Irina A. Lomazova , Andrey Rivkin

Data-aware processes represent and integrate structural and behavioural constraints in a single model, and are thus increasingly investigated in business process management and information systems engineering. In this spectrum, Data Petri…

Logic in Computer Science · Computer Science 2022-03-29 Paolo Felli , Marco Montali , Sarah Winkler

Process discovery aims to discover models that can explain the behaviors of event logs extracted from information systems. While various approaches have been proposed, only a few guarantee desirable properties such as soundness and…

Databases · Computer Science 2023-01-06 Tsung-Hao Huang , Wil M. P. van der Aalst

A model of an information system describes its processes and how resources are involved in these processes to manipulate data objects. This paper presents an extension to the Petri nets formalism suitable for describing information systems…

Formal Languages and Automata Theory · Computer Science 2026-04-08 Jan Martijn E. M. van der Werf , Andrey Rivkin , Marco Montali , Artem Polyvyanyy

Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized choice as communication primitive. Well-designed negotiations must be sound, meaning…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Javier Esparza , Denis Kuperberg , Anca Muscholl , Igor Walukiewicz

We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether a given state can be…

Computational Complexity · Computer Science 2025-01-23 Cornelius Brand , Robert Ganian , Fionn Mc Inerney , Simon Wietheger

First proposed by Wang and Li in 2007, workflow resiliency is a policy analysis for ensuring that, even when an adversarial environment removes a subset of workers from service, a workflow can still be instantiated to satisfy all the…

Cryptography and Security · Computer Science 2018-09-27 Philip W. L. Fong

For a large Markovian model, a "product form" is an explicit description of the steady-state behaviour which is otherwise generally untractable. Being first introduced in queueing networks, it has been adapted to Markovian Petri nets. Here…

Discrete Mathematics · Computer Science 2012-04-17 Serge Haddad , Jean Mairesse , Hoang-Thach Nguyen

A good process model is expected not only to reflect the behavior of the process, but also to be as easy to read and understand as possible. Because preferences vary across different applications, numerous measures provide ways to reflect…

Formal Languages and Automata Theory · Computer Science 2024-08-23 Patrizia Schalk , Adam Burke , Robert Lorenz

In this paper we propose two new subclasses of Petri nets with resets, for which the reachability and coverability problems become tractable. Namely, we add an acyclicity condition that only applies to the consumptions and productions, not…

Formal Languages and Automata Theory · Computer Science 2023-11-07 Dmitry Chistikov , Wojciech Czerwiński , Piotr Hofman , Filip Mazowiecki , Henry Sinclair-Banks

Noise is conventionally viewed as a severe problem in diverse fields, e.g., engineering, learning systems. However, this paper aims to investigate whether the conventional proposition always holds. It begins with the definition of task…

Machine Learning · Computer Science 2022-12-20 Xuelong Li
‹ Prev 1 2 3 10 Next ›