Sökning: "reachability"
Visar resultat 11 - 15 av 58 uppsatser innehållade ordet reachability.
11. Latency-aware edge server for safe autonomous driving
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : This thesis examines how a smart edge server, that communicates with autonomous vehicles in an intersection, could contribute to the safety of autonomous driving. Safe path planning is possible when an autonomous vehicle is aware of its surroundings such as obstacles, pedestrians, and other vehicles. LÄS MER
12. Graph-based Visualization of Sensor Data
Uppsats för yrkesexamina på grundnivå, Örebro universitet/Institutionen för naturvetenskap och teknikSammanfattning : Att visualisera rörelsedata är ett kraftigt undersökt område och en komplex uppgift. I det här projektet har jag använt rörelsedata insamlad av sensorer från Akademiska hus utplacerade på Örebro Universitetscampus. Datan är använd för att visualisera rörelser gjorda inuti byggnaderna genom en webapplikation skriven med enbart Python. LÄS MER
13. Parameterized Verification under The Total Store Order Memory Modelis EXPTIME-Complete
Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : In this paper, we study the problem of parameterized verification of a concurrent program running under the Total Store Order (TSO) memory model. A concurrent program is a finite set of processes that are instances of the same pushdown system and which communicate through a set of shared variables. LÄS MER
14. Getting Rid of Store Buffers in PSO Analysis
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : We propose an approach for reducing the PSO reachability analysis of concurrent programs to their SC reachability analysis, under some conditions on the explored behaviors. First, we propose a linear code- to-code translation that takes as input a concurrent program P and produces a concurrent program P such that, running under SC yieldsthe same set of reachable (shared) states as running P under PSO with at most k context-switches for each thread, for a fixed k. LÄS MER
15. Implementation and evaluation of bounded invariant model checking for a subset of Stateflow
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Stateflowmodels are used for describing logic and implementing state machines in modern safety-critical software. However, the complete Stateflowmodelling language is hard to formally define, therefore a subset relevant for industrial models has been developed in previous works. LÄS MER