Summary

• Page properties (1 modified, 0 added, 0 removed)
• Objects (1 modified, 0 added, 0 removed)
  • Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Content

...	...	@@ -48,50 +48,11 @@
48	48	**
49	49	**
50	50
51		-**Current work distribution: **
	51	+**Work distribution: **
52	52
53	53	**
54	54	**
55	55
56		-|=(((
57		-Task
58		-)))|=(((
59		-Assigned Persons
60		-)))
61		-|(((
62		-C-Inteface
63		-)))|(((
64		-Alexander
65		-)))
66		-|(((
67		-Mutual Exclusion
68		-)))|(((
69		-Nis
70		-)))
71		-|(((
72		-Station-to-Station
73		-)))|(((
74		-Personal assignments
75		-)))
76		-|(((
77		-Test Scenarios
78		-)))|(((
79		-Expert-groups
80		-)))
81		-|(((
82		-Deadlocks
83		-)))|(((
84		-Carsten
85		-)))
86		-|(((
87		-Integration
88		-)))|(((
89		-Small groups, dynamic time schedule
90		-)))
91		-
92		-**
93		-**
94		-
95	95	**Implementation in short:**
96	96
97	97	The main idea is, that we have a universal model of the track segments. From these single track segments, track sections, that connect train stations are modeled and from those track sections, all final schedules for the trains should be build. On each track segment, there should be at most one train: In order to drive over a track, a train must request this track, and afterwards it must free it again (details below). If two trains request the same track section, the priority, which is derived from the train number, decides, which train gets the track section. A train must request all tracks until the next possibility to stop an wait in order to avoid collisions. If the train does not get all track segments, it must free them again in order to avoid deadlocks or delays of other trains. Deadlocks might occur at the exists of all train stations, and additionally, if one train with a low priority exists the Kicking-Horse-path while another train with a higher priority sends an entry-request. It remains to be seen, if additional deadlocks occur. Deadlocks can be resolved by using a superior Mutex-Controller.
...	...	@@ -141,7 +141,7 @@
141	141
142	142	[[image:attach:csp_default_pass.png]]
143	143
144		-**Station-Station Modules**
	105	+=== Station-Station Modules ===
145	145
146	146	Input: Zugnummer, Startgleis, Zielgleis, Cleanup, (Mutex Variablen?)
147	147	Output: "Echtes" Zielgleis (Ausweichgleis?)
...	...	@@ -167,7 +167,7 @@
167	167
168	168	=== C-Interface ===
169	169
170		-The C-Interface wraps some general functions, in order to prevent long and ugly host-code statements within the SCCharts. It especially hides the railway pointer. In addition, the C-Interface provides a persistent environment during a macro step. To bring in some randomness, the time, which a train has to wait in a station, is controlled by the C-Interface. Therefore, trains have to notify the interface about their arrival and their departure.
	131	+The C-Interface wraps some general functions, in order to prevent long and ugly host-code statements within the SCCharts. It especially hides the railway pointer. In addition, the C-Interface provides a persistent environment during a macro step.
171	171
172	172
173	173

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9470778
	1	+9470776

URL

...	...	@@ -1,1 +1,1 @@
1		-https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SS14Railway/pages/9470778/Project goals
	1	+https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/SS14Railway/pages/9470776/Project goals