Sökning: "Parameterized Systems"

Visar resultat 1 - 5 av 76 avhandlingar innehållade orden Parameterized Systems.

1. 1. Parameterized Systems : Generalizing and Simplifying Automatic Verification

   Författare :Ahmed Rezine; Parosh Aziz Abdulla; Kedar Namjoshi; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Parameterized systems; Automatic verification; Approximation; Regular model checking; Safety; Termination; Computer science; Datavetenskap; Datavetenskap; Computer Science;

   Sammanfattning : In this thesis we propose general and simple methods for automatic verification of parameterized systems. These are systems consisting of an arbitrary number of identical processes or components. The number of processes defines the size of the system. LÄS MER

3. 2. Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis

   Författare :Frédéric Haziza; Parosh Aziz Abdulla; Tomáš Vojnar; Uppsala universitet; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; program verification; model checking; parameterized systems; infinite-state systems; reachability; approximation; safety; tree systems; shape analysis; small model properties; view abstraction; monotonic abstraction; Computer Science; Datavetenskap;

   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

4. 3. Infinite-state Stochastic and Parameterized Systems

   Författare :Noomene Ben Henda; Parosh Abdulla; Christel Baier; Uppsala universitet; []
   Nyckelord :program verification; model checking; stochastic games; infinite-state systems; Markov chains; reachability; repeated reachability; parameterized systems; approximation; safety; tree 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

5. 4. Numerical methods for parameterized linear systems

   Författare :Siobhán Correnty; Elias Jarlebring; Johan Karlsson; Kirk M. Soodhalter; Andrew J. Wathen; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Parameterized linear systems; Krylov subspace methods; preconditioning; tensor decompositions; shifted linear systems; parameterized partial differential equations; time-delay systems; transfer functions; parameter estimation problems; Parameteriserade linjära system; Krylov-metoder; förkonditionering; tensordekomposition; skiftade linjära system; parametriserade partiella differentialekvationer; tidsfördröjningssystem; överföringsfunktioner; parameteruppskattningsproblem; Numerical Analysis; Numerisk analys;

   Sammanfattning : Solving linear systems of equations is a fundamental problem in engineering. Moreover, applications involving the solution to linear systems arise in the social sciences, business, and economics. Specifically, the research conducted in this dissertation explores solutions to linear systems where the system matrix depends nonlinearly on a parameter. LÄS MER

7. 5. Verification of Parameterized and Timed Systems : Undecidability Results and Efficient Methods

   Författare :Johann Deneux; Parosh Abdulla; Eugene Asarin; Uppsala universitet; []
   Nyckelord :Parameterized Systems; Timed Systems; Symbolic Model Checking; Forward Reachability; Acceleration; Robust Languages; Language Universality; Automata Minimization; Bisimulation;

   Sammanfattning : Software is finding its way into an increasing range of devices (phones, medical equipment, cars...). LÄS MER