Time-constrained buffer specifications in CSP + T and timed CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Design and Verification of Distributed Recovery Blocks with CSP
Formal Methods in System Design
Symbolic model checking for a discrete clocked temporal logic with intervals
Proceedings of the IFIP WG 10.5 International Conference on Correct Hardware Design and Verification Methods: Advances in Hardware Design and Verification
Workflow Management: Models, Methods, and Systems
Workflow Management: Models, Methods, and Systems
Business process mining: An industrial application
Information Systems
Critical success factors for a customer relationship management strategy
Information and Software Technology
Semantics and analysis of business process models in BPMN
Information and Software Technology
Towards Formalization and Verification of Unified Business Process Model Based on Pi Calculus
SERA '08 Proceedings of the 2008 Sixth International Conference on Software Engineering Research, Management and Applications
Controllability in Temporal Conceptual Workflow Schemata
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Formalisations and applications of BPMN
Science of Computer Programming
Conformance testing: measuring the fit and appropriateness of event logs and process models
BPM'05 Proceedings of the Third international conference on Business Process Management
| Hi-index | 0.00 |
Context: To guarantee the success of Business Process Modelling (BPM) it is necessary to check whether the activities and tasks described by Business Processes (BPs) are sound and well coordinated. Objective: This article describes and validates a Formal Compositional Verification Approach (FCVA) that uses a Model-Checking (MC) technique to specify and verify BPs. Method: This is performed using the Communicating Sequential Processes +Time (CSP+T) process calculus, which adds new constructions to timed Business Process Model and Notation (BPMN) modelling entities for non- functional requirement specification. Results: Using our proposal we are able to specify the BP Task Model (BPTM) associated with BPs by formalising the timed BPMN notational elements. The proposal also allows us to apply MC to BPTM verification. A real-life example of verifying a BPTM in the field of Customer Relationship Management (CRM) is discussed as a practical application of FCVA. Conclusion: This approach facilitates the verification of complex BPs from independently verified local processes, and establishes a feasible way to use process calculi to verify BPs using state-of-the-art MC tools.