Formalising concurrent UML state machines using coloured Petri nets

Abstract

While UML state machines are widely used to specify dynamic systems behaviours, their semantics is described informally,which prevents the complex systems verification. In this paper, we propose a formalisation of concurrentUML state machines using coloured Petri nets.We consider in particular concurrent aspects (orthogonal regions, forks, joins, shared variables), the hierarchy induced by composite states and their associated activities, and entry/exit/do behaviours.