Fast termination and workflow nets

DOI10.1007/978-3-031-37706-8_7MaRDI QIDQ6535631zbMATH OpenFDO

Authors Piotr Hofman, Filip Mazowiecki, Philip Offtermatt

Publication date 1 February 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-37706-8_7

zbMATH Keywords

fast terminationgeneralised soundnesspolynomial timesoundnessworkflow net

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Soundness of timed-arc workflow nets
• Soundness of timed-arc workflow nets in discrete and continuous-time semantics
• Applications and Theory of Petri Nets 2005
• Verifying generalized soundness of workflow nets
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations

Cites work

• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Approaching the coverability problem continuously
• Automated Technology for Verification and Analysis
• Complexity analysis of continuous Petri nets
• Complexity of deciding Tarski algebra
• Computing the concurrency threshold of sound free-choice workflow nets
• Deciding fast termination for probabilistic VASS with nondeterminism
• Directed reachability for infinite-state systems
• Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
• Efficient Analysis of VASS Termination Complexity
• Free Choice Petri Nets
• Fundamentals of control flow in workflows
• scientific article; zbMATH DE number 1696472 (Why is no real title available?)
• scientific article; zbMATH DE number 2088769 (Why is no real title available?)
• On functions weakly computable by Petri nets and vector addition systems
• On the reachability problem for 5-dimensional vector addition systems
• Petri nets and regular languages
• Polynomial vector addition systems with states
• Reasoning about systems with many processes
• Reduction of workflow nets for generalised soundness verification
• Soundness and separability of workflow nets in the stepwise refinement approach
• Soundness of workflow nets: classification, decidability, and analysis
• The covering and boundedness problems for vector addition systems
• The logical view on continuous Petri nets
• The Reachability Problem for Petri Nets Is Not Elementary
• Verification of workflow nets
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• Verifying generalized soundness of workflow nets

This page was built for publication: Fast termination and workflow nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535631)