Boundedness of adaptive nets is decidable
Information Processing Letters
Causal nets: a modeling language tailored towards process discovery
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Automated error correction of business process models
BPM'11 Proceedings of the 9th international conference on Business process management
Ensuring correctness during process configuration via partner synthesis
Information Systems
Process Mining: Overview and Opportunities
ACM Transactions on Management Information Systems (TMIS)
Distributed process discovery and conformance checking
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Supervision of agents modelling evacuation at crisis situations
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Decomposing process mining problems using passages
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Complexity of the soundness problem of bounded workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Cost soundness for priced resource-constrained workflow nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Specifying and verifying declarative fluent temporal logic properties of workflows
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
Tying process model quality to the modeling process: the impact of structuring, movement, and speed
BPM'12 Proceedings of the 10th international conference on Business Process Management
International Journal of Electronic Finance
Generation of process using multi-objective genetic algorithm
Proceedings of the 2013 International Conference on Software and System Process
Using motivation and choreography to model distributed workflow
Proceedings of the 5th ACM SIGCHI Annual International Workshop on Behaviour Modelling - Foundations and Applications
Hierarchical conformance checking of process models based on event logs
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Minimizing test-point allocation to improve diagnosability in business process models
Journal of Systems and Software
On negotiation as concurrency primitive
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
International Journal of Web Services Research
Diagnosing correctness of semantic workflow models
Data & Knowledge Engineering
On generating *-sound nets with substitution
Information Systems
Refinement of Synchronizable Places with Multi-workflow Nets
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
Analyzing Compatibility of Services via Resource Conformance
Fundamenta Informaticae - Concurrency, Specification and Programming
Safety and Soundness for Priced Resource-Constrained Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
Complexity of the Soundness Problem of Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
Hi-index | 0.00 |
Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check the so-called soundness property. This property guarantees the absence of livelocks, deadlocks, and other anomalies that can be detected without domain knowledge. Several authors have proposed alternative notions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or priorities. This paper provides an overview of the different notions of soundness and investigates these in the presence of different extensions of workflow nets. We will show that the eight soundness notions described in the literature are decidable for workflow nets. However, most extensions will make all of these notions undecidable. These new results show the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.