Sökning: "reachability games"
Hittade 3 avhandlingar innehållade orden reachability games.
1. Games and Probabilistic Infinite-State Systems
Sammanfattning : Computer programs keep finding their ways into new safety-critical applications, while at the same time growing more complex. This calls for new and better methods to verify the correctness of software. We focus on one approach to verifying systems, namely that of model checking. LÄS MER
2. Infinite-state Stochastic and Parameterized Systems
Sammanfattning : A major current challenge consists in extending formal methods in order to handle infinite-state systems. Infiniteness stems from the fact that the system operates on unbounded data structure such as stacks, queues, clocks, integers; as well as parameterization. LÄS MER
3. Logics and Algorithms for Verification of Concurrent Systems
Sammanfattning : In this thesis we investigate how the known framework of automatic formal verification by model checking can be extended in different directions. One extension is to go beyond the common limitation of the existing specification formalisms, that they can describe only regular properties of components. LÄS MER