Abstract
Much research work has been done on linking UML and formal methods but few have focused on using formal methods to check the integrity of the UML models so that the models can be verified. In this paper we focus on executable UML and on the issues related to concurrent state machines. We show that one integrated formal methods approach, CSP ∥ B, has the potential to be tailored to support reasoning about concurrent state machines and in turn expose any weaknesses in the UML model. We identify future avenues of research so that a system methodology based on executable UML can be enhanced by formal reasoning. © 2009 Springer-Verlag.
Cite
CITATION STYLE
Treharne, H., Schneider, S., Grant, N., Evans, N., & Ifill, W. (2009). A step towards merging xUML and CSP ∥ B. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5115 LNCS, pp. 130–146). https://doi.org/10.1007/978-3-642-11447-2_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
