Sökning: "Forward Reachability"
Hittade 4 avhandlingar innehållade orden Forward Reachability.
1. Verification of Parameterized and Timed Systems : Undecidability Results and Efficient Methods
Sammanfattning : Software is finding its way into an increasing range of devices (phones, medical equipment, cars...). LÄS MER
2. Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis
Sammanfattning : This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees. LÄS MER
3. Verification of Infinite-State Systems : Decision Problems and Efficient Algorithms
Sammanfattning : This thesis presents methods for the verification of distributed systems with infinite state spaces. We consider several verification problems for lossy channel systems, a class of infinite-state systems consisting of finite-state machines that communicate over unbounded, but lossy, FIFO channels. LÄS MER
4. Safe Intersection and Merging Coordination of Connected and Automated Vehicles
Sammanfattning : Connected and automated vehicles (CAVs) are a transformative technology that promises to bring innovative solutions to transportation systems. One of their significant advantages is the elimination of human factors, which makes them capable of resolving the congestion problem prevalent in areas such as ramp merging points and road intersections. LÄS MER