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
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Responsiveness of interoperating components
Formal Aspects of Computing
A Formal Semantics of Timed Activity Diagrams and its PROMELA Translation
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
On the expressiveness of timed coordination models
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Verifying Business Process Compatibility (Short Paper)
QSIC '08 Proceedings of the 2008 The Eighth International Conference on Quality Software
Towards a unifying theory for choreography conformance and contract compliance
SC'07 Proceedings of the 6th international conference on Software composition
On Specifying and Visualising Long-Running Empirical Studies
ICMT '08 Proceedings of the 1st international conference on Theory and Practice of Model Transformations
Property Specifications for Workflow Modelling
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Formal analysis of BPMN models using event-B
FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Formalisations and applications of BPMN
Science of Computer Programming
Property specifications for workflow modelling
Science of Computer Programming
Safena and QBPM: a proposition for modeling and enacting processes in supply chain network
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Toward a Time-centric modeling of Business Processes in BPMN 2.0
Proceedings of International Conference on Information Integration and Web-based Applications & Services
| Hi-index | 0.00 |
We describe a relative-timed semantic model for Business Process Modelling Notation (BPMN). We define the semantics in the language of Communicating Sequential Processes (CSP). This model augments our untimed model by introducing the notion of relative time in the form of delays chosen non-deterministically from a range. We illustrate the application by an example. We also show some properties relating the timed semantics and BPMN's untimed process semantics by exploiting CSP refinement. Our timed semantics allows behavioural properties of BPMN diagrams to be mechanically verified via automatic model-checking as provided by the FDR tool.