15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (Ecbs 2008) 2008
DOI: 10.1109/ecbs.2008.12
|View full text |Cite
|
Sign up to set email alerts
|

Intuitive Mapping of UML 2 Activity Diagrams into Fundamental Modeling Concept Petri Net Diagrams and Colored Petri Nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
31
0
2

Year Published

2011
2011
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 68 publications
(34 citation statements)
references
References 21 publications
0
31
0
2
Order By: Relevance
“…This is formally defined by formulae (15)(16). In addition, after an instance of m j , there can be a new instance of the same message only after a new occurrence of m i ; this is stated by formula (17), which defines that, after m j , there will not be a new occurrence of m j until there is an occurrence of m i .…”
Section: Diagram-related Formulaementioning
confidence: 99%
See 2 more Smart Citations
“…This is formally defined by formulae (15)(16). In addition, after an instance of m j , there can be a new instance of the same message only after a new occurrence of m i ; this is stated by formula (17), which defines that, after m j , there will not be a new occurrence of m j until there is an occurrence of m i .…”
Section: Diagram-related Formulaementioning
confidence: 99%
“…If, for example, formulae (15)(16)(17) are instantiated for SD checkingSMS of Figure 2, one obtains formulae (18)(19)(20).…”
Section: Diagram-related Formulaementioning
confidence: 99%
See 1 more Smart Citation
“…According to the translation rule in Definition 7, the activity diagram  is first translated into the dependency structure td() = ⟨, I, T, S, C, P, F⟩ where  = {0, 1, 2, 3, 4, 5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39, i, f 1, f 2, f 3, f 4, f 5}, I = {{i}}, T = {({i}, {0}), ({0}, {3}), ({0}, {1}), ({1}, {2}), ({2}, {4}), ({2}, {8}), ({4}, {7}), ({7, 8}, {11}), ({3}, {5}), ({5}, {6}), ({6}, {f 1}), ({5}, {9}), ({9}, {10}), ({11}, {12}), ({12}, {13}), ({13}, {f 2}), ({12}, {14}), ({14}, {15}), ({15}, {16}), ({16}, {18}), ({18}, {f 3}), ({16}, {2}), ({15}, {17}), ({17}, {19}), ({10}, {20}), ({19}, {20}), ({20}, {21}), ({20}, {22}), ({21, 22}, {23}), ({23}, {24}), ({24}, {27}), ({27}, {29}),({29}, {30}),({29}, {31}),({30}, {28}),({30}, {25}),({28}, {26}),({26}, {25}), ({25}, {f 4}), ({31}, {20}), ({31}, {32}), ({32}, {33}), ({32}, {36}), ({33}, {34}), ({33}, {35}), ({34, 35}, {37}), ({37}, {38}), ({36}, {39}), ({38}, {39}), ({39}, {f 5})}, S = {{7, 8}, {21, 22}, {34, 35}}, C = {{1, 3}, {6, 9}, {13, 14}, {16, 17}, {25, 28}, {20, 32}, {33, 36}}, P = ∅, and F = {{f 1}, {f 2}, {f 3}, {f 4}, {f 5}}.…”
Section: Figurementioning
confidence: 99%
“…Similarly, if an activity diagram is translated into a Petri net, the places in such a Petri net also need to be additionally created. 19,20 Process algebras are an action/activity-based calculus. If an activity diagram is mapped to a process, one must add the synchronous event names that express the synchronization controls of the activity diagrams.…”
mentioning
confidence: 99%