Verification problems in conceptual workflow specifications
Data & Knowledge Engineering - Special issue on ER '96
The size-change principle for program termination
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
The Science of Programming
A Discipline of Programming
On Structured Workflow Modelling
CAiSE '00 Proceedings of the 12th International Conference on Advanced Information Systems Engineering
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
Reasoning about Complexity of Object-Oriented Programs
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Go to statement considered harmful
Software pioneers
A model for abstract process specification, verification and composition
Proceedings of the 2nd international conference on Service oriented computing
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
YAWL: yet another workflow language
Information Systems
Workflow models enhanced with process algebra verification for industrial business processes
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Using process algebra to control the execution of business processes
Proceedings of the 2008 ACM symposium on Applied computing
Semantics and analysis of business process models in BPMN
Information and Software Technology
Software composition with Linda
Computer Languages, Systems and Structures
Regular approximation and bounded domains for size-change termination
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Model Checking of Component Protocol Conformance -- Optimizations by Reducing False Negatives
Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming BPEL to petri nets
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Modeling- and analysis techniques for web services and business processes
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Approaches to modeling business processes: a critical analysis of BPMN, workflow patterns and YAWL
Software and Systems Modeling (SoSyM)
WorMS- a framework to support workflows in M&S
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
For safety and deadlock analysis of workflows, Petri-Nets are frequently used. They provide a natural abstraction of workflows since they are able to describe parallel behavior. With a variety of model checking tools, it is possible to verify these workflows. The usual approach that abstracts business processes to Petri-Nets requires that each loop (whether purely internal or with external interactions) is terminating. In this paper, we show that without this termination assumption, there are real behaviors of business processes that are not represented by the Petri-Net abstractions and we provide a first approach towards termination analysis of loops in business processes thereby ensuring the preconditions required by many Petri-Net based approaches for analyzing business processes.