Pre-Order Semantics of UML State-Machines

Yunming Wang 1 Jean-Pierre Talpin 1 Albert Benveniste 1 Paul Le Guernic 1
1 EP-ATR - Environnement de programmation d'applications temps réel
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : The concept of synchronous programming has been proposed and widely accepted in the design of real-time systems, circuits, and embedded systems. Some recent researches have also proposed a mechanism to distribute a synchronous system over asynchronous networks. Meanwhile, UML is also becoming a standard framework of object-oriented methodologies. Our research aims to take advantage of these rich backgrounds by integrating a synchronous pivot called SPOTS (synchronous pre-order transition system) into UML and to propose a new methodology for the development of real-time distributed systems. In this paper, we focus on the issue of UML state-machines. We first present a recursive structure of UML state-machines. Compared with earlier studies, this structure supports composite transitions and histories. After a brief introduction to the pivot SPOTS, we will concentrate on the formal semantics of We will also give some complete examples of the translation according to the prototype we have implemented.
Type de document :
[Research Report] RR-3958, INRIA. 2000
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:36:18
Dernière modification le : vendredi 16 novembre 2018 - 01:23:26
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:18:48



  • HAL Id : inria-00072690, version 1


Yunming Wang, Jean-Pierre Talpin, Albert Benveniste, Paul Le Guernic. Pre-Order Semantics of UML State-Machines. [Research Report] RR-3958, INRIA. 2000. 〈inria-00072690〉



Consultations de la notice


Téléchargements de fichiers