English
Related papers

Related papers: The complexity of soundness in workflow nets

200 papers

Confluence is a critical property of computational systems which is related with determinism and non ambiguity and thus with other relevant computational attributes of functional specifications and rewriting system as termination and…

Logic in Computer Science · Computer Science 2016-03-04 Mauricio Ayala-Rincón

Safety supervisors are controllers enforcing safety properties by keeping a system in (or returning it to) a safe state. The development of such high-integrity components can benefit from a rigorous workflow integrating formal design and…

Software Engineering · Computer Science 2022-03-18 Mario Gleirscher , Lukas Plecher , Jan Peleska

We address the problem of configuring a power distribution network with reliability and resilience objectives by satisfying the demands of the consumers and saturating each production source as little as possible. We consider power…

Computational Complexity · Computer Science 2023-11-21 Dominique Barth , Thierry Mautor , Dimitri Watel , Marc-Antoine Weisser

We study Colored Workflow nets, a model based on Workflow nets enriched with data. Based on earlier work by Esparza and Desel[arXiv:1307.2145,arXiv:1403.4958] on the negotiation model of concurrency, we present reduction rules for our…

Logic in Computer Science · Computer Science 2016-01-11 Javier Esparza , Philipp Hoffmann

Alignments provide sophisticated diagnostics that pinpoint deviations in a trace with respect to a process model and their severity. However, approaches based on trace alignments use crisp process models as reference and recent…

Databases · Computer Science 2021-07-09 Giacomo Bergami , Fabrizio Maria Maggi , Marco Montali , Rafael Peñaloza

Neural networks are vulnerable to adversarial attacks, i.e., small input perturbations can significantly affect the outputs of a neural network. Therefore, to ensure safety of neural networks in safety-critical environments, the robustness…

Machine Learning · Computer Science 2025-08-06 Lukas Koller , Tobias Ladner , Matthias Althoff

We introduce a broad class of analytically solvable processes on networks. In the special case, they reduce to random walk and consensus process - two most basic processes on networks. Our class differs from previous models of interactions…

Physics and Society · Physics 2012-03-12 Daniel Smilkov , Ljupco Kocarev

We propose a general proof technique to show that a predicate is sound, that is, prevents stuck computation, with respect to a big-step semantics. This result may look surprising, since in big-step semantics there is no difference between…

Programming Languages · Computer Science 2020-03-26 Francesco Dagnino , Viviana Bono , Elena Zucca , Mariangiola Dezani-Ciancaglini

A workflow specification defines a set of steps and the order in which those steps must be executed. Security requirements and business rules may impose constraints on which users are permitted to perform those steps. A workflow…

Data Structures and Algorithms · Computer Science 2013-03-14 Jason Crampton , Gregory Gutin

The execution of different cases of a process is often restricted by inter-case dependencies through e.g., queueing or shared resources. Various high-level Petri net formalisms have been proposed that are able to model and analyze…

Formal Languages and Automata Theory · Computer Science 2023-04-12 Dominique Sommers , Natalia Sidorova , Boudewijn F. van Dongen

This papers considers the problem of maximizing the load that can be served by a power network. We use the commonly accepted Linear DC power network model and consider wo configuration options: switching lines and using FACTS devices. We…

Computational Complexity · Computer Science 2015-07-20 Karsten Lehmann , Alban Grastien , Pascal Van Hentenryck

Researchers have been highly active to investigate the classical machine learning workflow and integrate best practices from the software engineering lifecycle. However, deep learning exhibits deviations that are not yet covered in this…

Software Engineering · Computer Science 2022-08-30 Janosch Baltensperger , Pasquale Salza , Harald C. Gall

We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…

Computational Complexity · Computer Science 2022-05-23 Norman Danner , James S. Royer

Dynamically typed languages such as Python have become very popular. Among other strengths, Python's dynamic nature and its straightforward linking to native code have made it the de-facto language for many research areas such as Artificial…

Programming Languages · Computer Science 2023-01-13 Wenting Zhao , Ibrahim Abdelaziz , Julian Dolby , Kavitha Srinivas , Mossad Helali , Essam Mansour

Some classical graph problems such as finding minimal spanning tree, shortest path or maximal flow can be done efficiently. We describe slight variations of such problems which are shown to be NP-complete. Our proofs use straightforward…

Computational Complexity · Computer Science 2020-01-14 Per Alexandersson

Most modern software systems (operating systems like Linux or Android, Web browsers like Firefox or Chrome, video encoders like ffmpeg, x264 or VLC, mobile and cloud applications, etc.) are highly-configurable. Hundreds of configuration…

Software Engineering · Computer Science 2019-06-10 Juliana Alves Pereira , Hugo Martin , Mathieu Acher , Jean-Marc Jézéquel , Goetz Botterweck , Anthony Ventresque

Context and Motivation: Natural language is the most common form to specify requirements in industry. The quality of the specification depends on the capability of the writer to formulate requirements aimed at different stakeholders: they…

Software Engineering · Computer Science 2023-08-25 Michael Unterkalmsteiner , Tony Gorschek

Many proposed applications of neural networks in machine learning, cognitive/brain science, and society hinge on the feasibility of inner interpretability via circuit discovery. This calls for empirical and theoretical explorations of…

Artificial Intelligence · Computer Science 2025-04-02 Federico Adolfi , Martina G. Vilas , Todd Wareham

We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable than in ordinary…

Computational Complexity · Computer Science 2015-06-29 Slawomir Lasota , Marcin Poturalski

Organizations use diverse types of security solutions to prevent cyberattacks. Multiple vendors provide security solutions developed using heterogeneous technologies and paradigms. Hence, it is a challenging rather impossible to easily make…

Cryptography and Security · Computer Science 2020-02-25 Chadni Islam , M. Ali Babar , Surya Nepal