Petri nets: an introduction
A Generalized Timed Petri Net Model for Performance Analysis
IEEE Transactions on Software Engineering
Some properties of timed nets under the earliest firing rule
Advances in Petri nets 1989
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Timed testing of concurrent systems
Information and Computation
Static Analysis and Dynamic Steering of Time-Dependent Systems
IEEE Transactions on Software Engineering
Timed Petri nets and preliminary performance evaluation
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Timed State Space Analysis of Real-Time Preemptive Systems
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets
IEEE Transactions on Software Engineering
Performance modeling and analysis of workflow
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
The main purpose of workflow management systems is to support the definition, execution, and control of workflow processes. With or without time constraints, workflow management systems should satisfy certain correctness properties. The most important and widely used is the soundness property. In this paper, we focus on the soundness property for two classes of Petri-net-based workflow management systems with time constraints, S- and A-timed workflow nets (WNs), and we show that this property is undecidable for them. The proof technique, based on the undecidability of the halting problem for deterministic counter machines, shows first that the reachability, coverability, boundedness, and quasi-liveness problems are undecidable for these two classes of timed WNs, and then, as a consequence, the undecidability of the soundness problem is derived.