Pre-Order Semantics of UML State-Machines - Inria - Institut national de recherche en sciences et technologies du numérique
Rapport (Rapport De Recherche) Année : 2000

Pre-Order Semantics of UML State-Machines

Résumé

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-3958.pdf (577.2 Ko) Télécharger le fichier

Dates et versions

inria-00072690 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00072690 , version 1

Citer

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⟩
119 Consultations
159 Téléchargements

Partager

More