Search for dissertations about: "Dependable Communication and Computation Systems"
Showing result 11 - 15 of 34 swedish dissertations containing the words Dependable Communication and Computation Systems.
-
11. Model-Integrated Engineering of Smart Energy Distribution Systems
Abstract : Model-Based Systems Engineering (MBSE) is a method that is used to support analysis, design, independent verification, and validation inherent in the development of software and hardware systems. MBSE applications are present in many areas of our daily lives, including manufacturing, robotics, healthcare, automation, etc. READ MORE
-
12. Garbage collecting reactive real-time systems
Abstract : As real-time systems become more complex, the need for more sophisticated runtime kernel features arises. One such feature that substantially lessens the burden of the programmer is automatic memory management, or garbage collection. However, incorporating garbage collection in a real-time kernel is not an easy task. READ MORE
-
13. Garbage collection for reactive real-time systems
Abstract : Predictable use of resources, such as processor time and memory, is a desirable property for virtually any computer system. In real-time computing, static predictability is of particular concern. READ MORE
-
14. Creating and maintaining topologies in wireless networks
Abstract : Wireless ad-hoc networks differs in many aspects compared to traditional infrastructured networks. Among other things, individual nodes cannot be expected to know the topology of the entire network. READ MORE
-
15. The Euclidean traveling salesman problem with neighborhoods and a connecting fence
Abstract : An important class of problems in robotics deals with the planning of paths. In this thesis, we study this class of problems from an algorithmic point of view by considering cases where we have complete knowledge of the environment and each solution must ensure that a point-sized robot capable of moving continuously and turning arbitrarily accomplishes the following: (1) visits a given set of objects attached to an impenetrable simple polygon in the plane, and (2) travels along a path of minimum length over all the possible paths that visit the objects without crossing the polygon. READ MORE