Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 55 for “"Infinite-state"”.

  1. Algorithmic Analysis of Infinite-State Systems

    … concurrent and distributed algorithms generate infinite state-spaces. Model-checking which is the most prominent algorithmic technique for the verification of concurrent systems is restricted to the analysis of finite-state models. Algorithmic analysis of infinite-state models is …

    waterloo Repository record for Algorithmic Analysis of Infinite-State Systems (opens in a new tab)

  2. Types and verification for infinite state systems

    Server-like or non-terminating programs are central to modern computing. It is a common requirement for these programs that they always be available to produce a behaviour. One method of showing such availability is by endowing a type-theory with constraints that demonstrate that a program will …

    dcu Download PDF for Types and verification for infinite state systems (opens in a new tab)

  3. Symbolic Methods for Exploring Infinite State Spaces

    … method for computing the set of reachable states of an infinite-state system. The basic idea, inspired by well-known state-space exploration methods for finite-state systems, is to propagate reachability from the initial state of the system in order to determine exactly which are the …

    liege Repository record for Symbolic Methods for Exploring Infinite State Spaces (opens in a new tab) Download PDF for Symbolic Methods for Exploring Infinite State Spaces (opens in a new tab)

  4. Connections between arithmetic theories and infinite-state systems

    <p>Infinite-state systems are crucial for modelling the behaviour of computer programs, concurrent processes, and reasoning about formal languages. One fundamental area of research in theoretical computer science is the study of the computational complexity of the decision problems associated with …

    oxford Repository record for Connections between arithmetic theories and infinite-state systems (opens in a new tab)

  5. STAMINA: Stochastic Approximate Model-Checker for Infinite-State Analysis

    … model reduction technique generating a finite state representations of large systems that are amenable to existing probabilistic model checking techniques. The proposed method is evaluated on several benchmark examples. Comparisons with another state-of-art tool demonstrates both accuracy and …

    utahstate Repository record for STAMINA: Stochastic Approximate Model-Checker for Infinite-State Analysis (opens in a new tab)

  6. Generic Techniques for the verification of infinite-state systems

    Within the context of the verification of infinite-state systems,'Regular model checking' is the name of a family of techniques inwhich states are represented by words or trees, sets of states byfinite automata on these objects, and transitions by finite automataoperating on pairs of state …

    liege Repository record for Generic Techniques for the verification of infinite-state systems (opens in a new tab) Restricted access

  7. Assumption-Based Runtime Verification of Finite- and Infinite-State Systems

    … the monitors can be synthesized as finite-state machines implemented by Binary Decision Diagrams. With infinite-domain variables, the infinite-state monitors are based on satisfiability modulo theories, first-order quantifier elimination and various model checking techniques. In particular, …

    trento Repository record for Assumption-Based Runtime Verification of Finite- and Infinite-State Systems (opens in a new tab)

  8. Formal Techniques for Realizability Checking and Synthesis of Infinite-State Reactive Systems

    … first attempt ever to synthesize witnesses for infinite-state problems in which the implementation behaves in a random, diverse manner. While the product of synthesis is typically expected to be a deterministic witness, we argue that randomness can still be valuable in practice. To that end, we …

    umn Repository record for Formal Techniques for Realizability Checking and Synthesis of Infinite-State Reactive Systems (opens in a new tab)

  9. Formal techniques for realizability checking and synthesis of infinite-state reactive systems

    … first attempt ever to synthesize witnesses for infinite-state problems in which the implementation behaves in a random, diverse manner. While the product of synthesis is typically expected to be a deterministic witness, we argue that randomness can still be valuable in practice. To that end, we …

    greece Repository record for Formal techniques for realizability checking and synthesis of infinite-state reactive systems (opens in a new tab)

  10. Efficient Methods and Algorithms for Analyzing Stochastic Systems

    … of such systems: their typically large or infinite state spaces, and the extreme rarity of error states of interest. While Monte Carlo simulation can analyze biochemical systems without storing the state space, accurately estimating rare event probabilities becomes computationally …

    usf Repository record for Efficient Methods and Algorithms for Analyzing Stochastic Systems (opens in a new tab)

  11. Facing infinity in model checking expressive specification languages

    … of expressive specifications on timed and infinite-state systems. An expressive specification language allows the description of the intended behaviour of a system via compact formal statements written at an abstraction level that eases the review process. Falsifying a specification …

    trento Repository record for Facing infinity in model checking expressive specification languages (opens in a new tab)

  12. Refined Probabilistic Abstraction

    … that a system enters a particular set of goal states, e.g., states in which packages have been transmitted successfully. Despite the remarkable versatility of existing methods, they are inherently limited to systems with very small state spaces. This dissertation proposes new methods that solve …

    oxford Restricted access

  13. On the complexity of model checking counter automata

    … and practical aspects of the verification of infinite-state systems have attracted a lot of interest in the verification community throughout the last 30 years. One goal is to identify classes of infinite-state systems that admit decidable decision problems on the one hand, and which are …

    oxford Repository record for On the complexity of model checking counter automata (opens in a new tab)

  14. Skatinamasis mokymas stalo žaidimams spręsti /

    … is not capable of solving tasks with large or infinite state spaces.

    vilnius Repository record for Skatinamasis mokymas stalo žaidimams spręsti / (opens in a new tab)

  15. Time-Inhomogeneous Quantum Markov Chains

    … with decoherence on finite spaces and discrete infinite spaces and their large scale equilibrium properties. In this thesis, we prove the convergence of decoherent time-inhomogeneous quantum Markov chain on finite state spaces, and a representation theorem for time-inhomogeneous quantum walk on …

    temple Repository record for Time-Inhomogeneous Quantum Markov Chains (opens in a new tab)

  16. Temporal Logic Model Checking as Automated Theorem Proving

    … (FOL); as a result, model checking of finite/infinite state systems without the use of iteration or abstraction is considered beyond the realm of automated FOL theorem provers. In this thesis, we focus on formulating the temporal logic model checking problem as a FOL theorem proving problem …

    waterloo Repository record for Temporal Logic Model Checking as Automated Theorem Proving (opens in a new tab)

  17. On the decidability of problems in liveness of controlled Discrete Event Systems modeled by Petri Nets

    "A Discrete Event System (DES) is a discrete-state system, where the state changes at discrete-time instants due to the occurrence of events. Informally, a liveness property stipulates that a 'good thing' happens during the evolution of a system. Some examples of liveness properties include …

    uiuc Repository record for On the decidability of problems in liveness of controlled Discrete Event Systems modeled by Petri Nets (opens in a new tab)

  18. Scheduling Policy Design using Stochastic Dynamic Programming

    … system. We model this scheduling problem as an infinite-state Markov decision process, and provide guarantees regarding the existence of optimal solutions to this problem. We derive several methods for approximating optimal scheduling policies and provide theoretical justification and empirical …

    wustl Repository record for Scheduling Policy Design using Stochastic Dynamic Programming (opens in a new tab)

  19. Predicate Diagrams as Basis for the Verification of Reactive Systems

    … techniques for the verification of finite and infinite-state systems, thus combining the expressive power and flexibility of deduction with the automation provided by algorithmic methods. Our formal framework for the specification and verification of reactive systems includes the Generalized …

    lmu-germany Repository record for Predicate Diagrams as Basis for the Verification of Reactive Systems (opens in a new tab)

Page 1 of 3