2005
DOI: 10.1007/11576280_5
|View full text |Cite
|
Sign up to set email alerts
|

29 New Unclarities in the Semantics of UML 2.0 State Machines

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0
1

Year Published

2007
2007
2010
2010

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 51 publications
(28 citation statements)
references
References 8 publications
0
27
0
1
Order By: Relevance
“…Additionally works such as presented in [18] propose extension of the MARTE profile to introduce notion of dynamic power consumption. However, these works make use of traditional UML state machines which are already ambiguous in nature and need proper semantics [19], [20]. However, these aspects can be a future extension of our design methodology, and can be a future perspective.…”
Section: Related Workmentioning
confidence: 99%
“…Additionally works such as presented in [18] propose extension of the MARTE profile to introduce notion of dynamic power consumption. However, these works make use of traditional UML state machines which are already ambiguous in nature and need proper semantics [19], [20]. However, these aspects can be a future extension of our design methodology, and can be a future perspective.…”
Section: Related Workmentioning
confidence: 99%
“…Many of the semantic problems identified in [7] remain in the UML 2 state machine notation definitions of [20]. In particular, the definitions of transition priority have not been improved and remain ambiguous: "The priority of joined transitions is based on the priority of the transition with the most transitively nested source state" (page 547 of [20]).…”
Section: Solutions For Semantic Problemsmentioning
confidence: 99%
“…In particular, the definitions of transition priority have not been improved and remain ambiguous: "The priority of joined transitions is based on the priority of the transition with the most transitively nested source state" (page 547 of [20]). Page 548 of [20] gives an algorithm for calculating the fired set of transitions when an event occurs, this algorithm involves starting from "innermost nested simple states", which does not resolve cases such as Figure 3, reproduced from [7]. We assume that all the transitions are triggered by the same event and have true guards.…”
Section: Solutions For Semantic Problemsmentioning
confidence: 99%
See 2 more Smart Citations