1993
DOI: 10.1016/0164-1212(93)90027-u
|View full text |Cite
|
Sign up to set email alerts
|

Partial orderings of event sets and their application to prototyping concurrent, timed systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
11
0

Year Published

1996
1996
2017
2017

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 44 publications
(11 citation statements)
references
References 5 publications
0
11
0
Order By: Relevance
“…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%
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%
“…Dependency structures are an extended version of the event-based models, such as the event structures, 31 the configuration structures, 32,33 and the Rapide approach. 34 They support true concurrency, loop, event synchronization, and priority scheduling modeling. More importantly, the UML activity diagrams can simply and directly be translated into dependency structures, without adding or reducing the information of activity diagrams.…”
mentioning
confidence: 99%
“…We created a working, high-level prototype in Proteus, 2 where it was quickly discovered that the specification had errors (there are indexing bugs in the normalization step). The occurrence of bugs in the highlevel specification is not uncommon since specifications are typically written without formal verification.…”
Section: Prototyping the Column-recursive Jpdamentioning
confidence: 99%
“…In this paper, we do not address this type of concurrency, although other techniques, such as objectbased concurrency, can be used along with the approach we describe here [1], [47]. Other reasons for using concurrency, such as the development of reactive systems or faulttolerant systems, are also better treated using other techniques [2].…”
mentioning
confidence: 99%
“…It is designed for prototyping system architectures. Rapide works with a causal event history and a set of events and relationships by creating a partial ordering of sets of events called posets [15]. Relationships can be defined using maps (aggregators) that list the input and output event patterns.…”
Section: Related Workmentioning
confidence: 99%