A.1 Transportation Nets 8.9 Exercises Note: The next three assignments are, in a sense, premature. They ask that you express something in RSL, of which you have yet to learn the essentials. But try anyway! In the present and in the previous chapters there is indeed enough material on RSL to build upon. But that material will be reintroduced, and then very more By a transportation net we understand a composition of road nets (of various kinds: publie roads, toll roads [viz.:toll booth or electronically road priced free ways, etc.), rail nets, nets of air traffic corridors, and nets of shipping lanes. Common, we claim, to all these nets are their composition from segments (street or road segments, rail lines between stations, air corridors, etc.), and y much more systematically, from Part III on (street intersections, railway stations, airports and harbours) So nets, segments and connections (or intersections) are important con- cepts. They abstract phenomena such as mentioned above (roads, lines, and lanes, respectively street corners, train stations, airports and harbours) Exercise 8.1.4 Suggest a Transportation Net Algebra, Segments may be decomposed into blocks, i.e., a segment being a sequence of blocks. And blocks (hence segments), as well as connections, may contain zero, one or more conveyours (cars, trains usually at most one], air crafts or ships). Conveyors may move so that traffic can be abstracted as a function from time to positions of conveyors (in, or within, blocks and connections) We refer to Appendix A, Sect. A1, Transportation Net Suggest short sort (or type) names for Transportation Net entities (nets, segments, connections), and signatures for (four) functions that insert [delete] a new [an "old] segment, and that insert [delete] a new [an "old"] connection (intersection). Write out axioms, in English, stating properties that must hold of any input argument or result value segment, intersection and transportation net. "Wrap the whole thing into a scheme declaration. Issues of allocation, scheduling and control of traffic can then be ap Exercises related to this topic are: 2.6, 3.3, 4.4, 5.1, 5.2, 5.3, 8.1,9.1, 10.2, Examples 9.8 and 9.12 also relate to this exercise topic. proached. 11.1, 12.4, 13.5, 14.6, 15.15, 16.12, 18.1, 19.4, 20.4 and 21.12. A.1 Transportation Nets 8.9 Exercises Note: The next three assignments are, in a sense, premature. They ask that you express something in RSL, of which you have yet to learn the essentials. But try anyway! In the present and in the previous chapters there is indeed enough material on RSL to build upon. But that material will be reintroduced, and then very more By a transportation net we understand a composition of road nets (of various kinds: publie roads, toll roads [viz.:toll booth or electronically road priced free ways, etc.), rail nets, nets of air traffic corridors, and nets of shipping lanes. Common, we claim, to all these nets are their composition from segments (street or road segments, rail lines between stations, air corridors, etc.), and y much more systematically, from Part III on (street intersections, railway stations, airports and harbours) So nets, segments and connections (or intersections) are important con- cepts. They abstract phenomena such as mentioned above (roads, lines, and lanes, respectively street corners, train stations, airports and harbours) Exercise 8.1.4 Suggest a Transportation Net Algebra, Segments may be decomposed into blocks, i.e., a segment being a sequence of blocks. And blocks (hence segments), as well as connections, may contain zero, one or more conveyours (cars, trains usually at most one], air crafts or ships). Conveyors may move so that traffic can be abstracted as a function from time to positions of conveyors (in, or within, blocks and connections) We refer to Appendix A, Sect. A1, Transportation Net Suggest short sort (or type) names for Transportation Net entities (nets, segments, connections), and signatures for (four) functions that insert [delete] a new [an "old] segment, and that insert [delete] a new [an "old"] connection (intersection). Write out axioms, in English, stating properties that must hold of any input argument or result value segment, intersection and transportation net. "Wrap the whole thing into a scheme declaration. Issues of allocation, scheduling and control of traffic can then be ap Exercises related to this topic are: 2.6, 3.3, 4.4, 5.1, 5.2, 5.3, 8.1,9.1, 10.2, Examples 9.8 and 9.12 also relate to this exercise topic. proached. 11.1, 12.4, 13.5, 14.6, 15.15, 16.12, 18.1, 19.4, 20.4 and 21.12