Fast termination and workflow nets
From MaRDI portal
Publication:6535631
DOI10.1007/978-3-031-37706-8_7zbMath1547.68501MaRDI QIDQ6535631
Philip Offtermatt, Filip Mazowiecki, Piotr Hofman
Publication date: 1 February 2024
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Soundness of workflow nets: classification, decidability, and analysis
- On the reachability problem for 5-dimensional vector addition systems
- Petri nets and regular languages
- The covering and boundedness problems for vector addition systems
- Complexity of deciding Tarski algebra
- Fundamentals of control flow in workflows
- Directed reachability for infinite-state systems
- Approaching the coverability problem continuously
- Computing the concurrency threshold of sound free-choice workflow nets
- Complexity Analysis of Continuous Petri Nets
- Reduction of Workflow Nets for Generalised Soundness Verification
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism
- Verifying Generalized Soundness of Workflow Nets
- On Functions Weakly Computable by Petri Nets and Vector Addition Systems
- Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
- Reasoning about systems with many processes
- Free Choice Petri Nets
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings
- The Reachability Problem for Petri Nets Is Not Elementary
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
- Efficient Analysis of VASS Termination Complexity
- The Logical View on Continuous Petri Nets
- Automated Technology for Verification and Analysis
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
- Occam's razor applied to the Petri net coverability problem
- Verification of workflow nets
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
This page was built for publication: Fast termination and workflow nets
