The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Specification of communicating processes: temporal logic versus refusals-based refinement
Formal Aspects of Computing
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
A Relative Timed Semantics for BPMN
Electronic Notes in Theoretical Computer Science (ENTCS)
Specifying and Verifying Business Processes Using PPML
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Formalisations and applications of BPMN
Science of Computer Programming
Specification patterns from research to industry: a case study in service-based applications
Proceedings of the 34th International Conference on Software Engineering
A pattern-based approach for the verification of business process descriptions
Information and Software Technology
| Hi-index | 0.00 |
Previously we provided two formal behavioural semantics for Business Process Modelling Notation (BPMN) in the process algebra CSP. By exploiting CSP's refinement orderings, developers may formally compare their BPMN models. However, BPMN is not a specification language, and it is difficult and sometimes impossible to use it to construct behavioural properties against which BPMN models may be verified. This paper considers a pattern-based approach to expressing behavioural properties. We describe a property specification language PL for capturing a generalisation of Dwyer et al.'s Property Specification Patterns, and present a translation from PL into a bounded, positive fragment of linear temporal logic, which can then be automatically translated into CSP for simple refinement checking. We demonstrate its application via a simple example.