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
Concurrency: state models & Java programs
Concurrency: state models & Java programs
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
How to Make FDR Spin LTL Model Checking of CSP by Refinement
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Compatibility Verification for Web Service Choreography
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Responsiveness of interoperating components
Formal Aspects of Computing
Model-Based Analysis of Obligations in Web Service Choreography
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Bounded Model Checking of Compositional Processes
TASE '08 Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
Specification of communicating processes: temporal logic versus refusals-based refinement
Formal Aspects of Computing
Semantics and analysis of business process models in BPMN
Information and Software Technology
Verifying Business Process Compatibility (Short Paper)
QSIC '08 Proceedings of the 2008 The Eighth International Conference on Quality Software
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Realizability of Choreographies Using Process Algebra Encodings
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
A Relative Timed Semantics for BPMN
Electronic Notes in Theoretical Computer Science (ENTCS)
Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more
International Journal on Software Tools for Technology Transfer (STTT)
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
A theory for strong service compliance
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Towards a unifying theory for choreography conformance and contract compliance
SC'07 Proceedings of the 6th international conference on Software composition
Formal analysis of BPMN via a translation into COWS
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Form follows function: model-driven engineering for clinical trials
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
Specifying and verifying declarative fluent temporal logic properties of workflows
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
A case study on the lightweight verification of a multi-threaded task server
Science of Computer Programming
Hi-index | 0.00 |
Previously we provided two formal behavioural semantics for the 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 other 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 present a detailed example studying the behavioural properties of an airline ticket reservation business process. Using the same example we also describe some recent results on expressing behavioural compatibility within our semantic models. These results lead to a compositional approach for ensuring deadlock freedom of interacting business processes.