Search citation statements

Paper Sections

Select...

2

2

1

Citation Types

0

5

0

Year Published

2010

2014

Publication Types

Select...

3

1

Relationship

0

4

Authors

Journals

(5 citation statements)

(5 reference statements)

0

5

0

“…To obtain a finite automaton, possible traces that contain the same set of events are identified. An SD has also been translated to a Petri net (e.g., [Cardoso and Sibertin-Blanc 2001;Eichner et al 2005;Fernandes et al 2007]) and abstract state machines (e.g., [Cavarra and Küster-Filipe 2004;Kohlmeyer and Guttmann 2010;Xiang and Shao 2009]). Refinement is not considered [Cardoso and Sibertin-Blanc 2001;Cavarra and Küster-Filipe 2004;Eichner et al 2005;Fernandes et al 2007;Hammal 2006;Kohlmeyer and Guttmann 2010;Whittle and Schumann 2000;Ziadi et al 2004;Xiang and Shao 2009].…”

confidence: 99%

“…To obtain a finite automaton, possible traces that contain the same set of events are identified. An SD has also been translated to a Petri net (e.g., [Cardoso and Sibertin-Blanc 2001;Eichner et al 2005;Fernandes et al 2007]) and abstract state machines (e.g., [Cavarra and Küster-Filipe 2004;Kohlmeyer and Guttmann 2010;Xiang and Shao 2009]). Refinement is not considered [Cardoso and Sibertin-Blanc 2001;Cavarra and Küster-Filipe 2004;Eichner et al 2005;Fernandes et al 2007;Hammal 2006;Kohlmeyer and Guttmann 2010;Whittle and Schumann 2000;Ziadi et al 2004;Xiang and Shao 2009].…”

confidence: 99%

“…In [3], [8] and [9], a sequence diagram is translated into a Petri net, with the lifelines translated into processes, actions to transitions, and messages to communication places. In [4], [14] and [24], a sequence diagram is translated into an abstract state machine (ASM). Refinement is not considered in [3], [8], [9], [4], [14], or [24].…”

confidence: 99%

“…In [4], [14] and [24], a sequence diagram is translated into an abstract state machine (ASM). Refinement is not considered in [3], [8], [9], [4], [14], or [24]. In [11], safety and liveness semantics for sequence diagrams is given in terms of Büchi automata, and refinement is defined as set containment.…”

confidence: 99%

“…To obtain a finite automaton, possible traces that contain the same set of events are identified. An SD has also been translated to a Petri net (e.g., [8], [17], [20]) with lifelines translated to processes, actions to transitions and messages to communication places and to abstract state machines (e.g., [9], [41], [70]). Refinement is not considered in [8], [9], [17], [20], [29], [41], [69], [70], [71].…”

confidence: 99%