The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Relaxed Soundness of Business Processes
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
Incremental Verification by Abstraction
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Model Checking Partial State Spaces with 3-Valued Temporal Logics
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Multi-valued symbolic model-checking
ACM Transactions on Software Engineering and Methodology (TOSEM)
Data flow and validation in workflow modelling
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Three-Valued Abstractions of Games: Uncertainty, but with Precision
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Process Aware Information Systems: Bridging People and Software Through Process Technology
Process Aware Information Systems: Bridging People and Software Through Process Technology
Symbolic model checking of UML activity diagrams
ACM Transactions on Software Engineering and Methodology (TOSEM)
Formulating the Data-Flow Perspective for Business Process Management
Information Systems Research
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
ACM Transactions on Computational Logic (TOCL)
Extending the compatibility notion for abstract WS-BPEL processes
Proceedings of the 17th international conference on World Wide Web
3-Valued abstraction: More precision at less cost
Information and Computation
Deciding service composition and substitutability using extended operating guidelines
Data & Knowledge Engineering
Data-Flow Anti-patterns: Discovering Data-Flow Errors in Workflows
CAiSE '09 Proceedings of the 21st International Conference on Advanced Information Systems Engineering
Verifying generalized soundness of workflow nets
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
ProM 4.0: comprehensive support for real process analysis
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Solving games via three-valued abstraction refinement
Information and Computation
Workflow soundness revisited: checking correctness in the presence of data while staying conceptual
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Soundness of workflow nets: classification, decidability, and analysis
Formal Aspects of Computing
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On the refactoring of activity labels in business process models
Information Systems
Ensuring correctness during process configuration via partner synthesis
Information Systems
International Journal of Electronic Finance
Data-aware process mining: discovering decisions in processes using alignments
Proceedings of the 28th Annual ACM Symposium on Applied Computing
BPM'13 Proceedings of the 11th international conference on Business Process Management
Diagnosing correctness of semantic workflow models
Data & Knowledge Engineering
Detection of naming convention violations in process models for different languages
Decision Support Systems
How to guarantee compliance between workflows and product lifecycles?
Information Systems
| Hi-index | 0.00 |
A conceptual workflow model specifies the control flow of a workflow together with abstract data information. This model is later on refined by adding specific data information, resulting in an executable workflow which is then run on an information system. It is desirable that correctness properties of the conceptual workflow are transferable to its refinements. In this paper, we present classical workflow nets extended with data operations as a conceptual workflow model. For these nets, we develop a novel technique to verify soundness. An executable workflow is sound if from every reachable state it is always possible to terminate properly. Our technique allows us to analyze a conceptual workflow and to conclude whether there exists at least one sound refinement of it, and whether any refinement of a conceptual workflow model is sound. The positive answer to the first question in combination with the negative answer to the second question means that sound and unsound refinements for the conceptual workflow in question are possible.