Coverage-driven automatic test generation for uml activity diagrams
Proceedings of the 18th ACM Great Lakes symposium on VLSI
Curricula Modeling and Checking
AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
The High Road to Formal Validation
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Towards Component-Based Design and Verification of a μ-Controller
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
A Relative Timed Semantics for BPMN
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Tool support for the rapid composition, analysis and implementation of reactive services
Journal of Systems and Software
An evaluation of timed scenario notations
Journal of Systems and Software
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
Contracts for multi-instance UML activities
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Proceedings of the 10th ACM international conference on Generative programming and component engineering
Hi-index | 0.00 |
The lack of a precise semantics for UML activity diagrams makes the reasoning on models constructed using such diagrams infeasible. However, such diagrams are widely used in domains that require a certain degree of confidence. Due to economical interests, the business domain is one of these. To enhance confidence level of UML activity diagrams, this paper provides a formal definition of their syntax and semantics. The main interest of our approach is that we chose UML activity diagrams, which are recognized to be more tractable by engineers, and we extend them with timing constraints. We outline the translation of our semantics into the PROMELA input language of the SPIN model checker which can be used to check several properties.