• Aucun résultat trouvé

Semantics and implementation of a refinement relation for behavioural models

N/A
N/A
Protected

Academic year: 2021

Partager "Semantics and implementation of a refinement relation for behavioural models"

Copied!
16
0
0

Texte intégral

Loading

Figure

Fig. 1. Overview of the computation of extension relation
Fig. 2. Rules to transform transitions of UML state machines into LTS
Fig. 4. (a) SM SimplePhone (b) SM DoubleCall
Fig. 5. (a) LTS SimplePhone (b) LTS DoubleCall
+3

Références

Documents relatifs

In our previous work (De Lucia et al. 2004b), we analysed the distribution of galaxies on the red sequence for four high-redshift EDisCS clusters, and we compared such a distribution

In order to follow theorem 2, the conformance relation (function conf ) has been im- plemented into three steps: build up of acceptance graphs associated with the reference LTS

When persons with or without national affiliations migrate between regions, countries, states, and continents, then the forms of this movement, the attributions

Either a cross-sectional study, in which only one snapshot of the network is looked at and analyzed; or a longitudinal study, in which several consecutive snapshots of the network

of a square lattice the frontier is made of those A atoms which are connected through nearest neighbours with the diffusion source and have an empty first or second

• We show that it is indeed possible to formally establish the soundness of significant bisimulation-up-to techniques for standard process calculi even when the transition systems

o Tania Rodriguez-Gabella dans son étude « Long-Term Outcomes Following Surgical Aortic Bioprosthesis Implantation » faite au canada et publié en Avril 2018 qui a étudié les

Most of these methods rely on human motion data that is recorded with MoCap (Motion Capture) technique; accordingly a kinematic DHM can then realize very realistic motions by