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 93 for “"Nondeterminism"”.
-
Parallelism with limited nondeterminism
… Specifically, we show tradeoffs between time, nondeterminism, and parallelizability. By clearly defining the notions and complexity classes that capture our intuition for parallelizable and sequential problems, we create a comprehensive framework for rigorously proving parallelizability and …
-
Finite Automata with Restricted Nondeterminism and Universality
… between NFAs with different amounts of limited nondeterminism. Previously studied measures of limited nondeterminism include the ambiguity, tree width, and path width, which, respectively, measure the number of accepting computations, the total number of computations, and the number of complete …
-
Probability and nondeterminism in compositional game theory
<p>We substantially extend previous work in the emerging field of compositional game theory.</p> <p>We generalise work by Escardó and Oliva relating the selection monad to game theory. Escardó and Oliva showed that the tensor operation of selection functions computes a subgame perfect …
-
Nondeterminism and Language Design in Deep Inference
… of inference rules causes much greater nondeterminism in proof construction. This thesis attacks the problem of dealing with nondeterminism in proof search while preserving the shorter proofs that are available thanks to deep inference. By redesigning the deep inference deductive …
-
Nondeterminism as a reproducibility challenge for deep reinforcement learning
… for reproducing results successfully. However, nondeterminism is a reproducibility challenge that is perhaps less emphasized despite being particularly relevant in DRL. DRL algorithms tend to have high variance, in no small part due to the fact that agents must learn from a nonstationary …
-
State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism
Various approaches of quantifying nondeterminism in nondeterministic finite automata (NFA) are considered. We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation on any input string has a constant number of branches. We give effective characterizations …
-
Exposing and fixing causes of inconsistency and nondeterminism in clustering implementations
… show that clustering implementations suffer from nondeterminism and inconsistency: on a given input dataset and using a given clustering algorithm, clustering outcomes and accuracy vary widely between (1) successive runs of the same toolkit, i.e., nondeterminism, and (2) different toolkits, i.e, …
-
A Kleene Theorem and Decision Problems for Probability and Angelic Nondeterminism
… of probabilistic Kleene al- gebra with angelic nondeterminism and the corresponding class of automata. This approach implements semantics via distributions over multisets in order to overcome the theoretical barriers arising from the absence of a distributive law. Chapter 3 introduces the model …
-
Taming nondeterminism : programming language abstractions and tools for dealing with nondeterministic programs
… to deal with nondeterministic environments. This nondeterminism may arise from many sources, like user input and concurrency for example. If program input were to be deterministic, there would be no need for complex programs. A word processor with deterministic input can simply present the user …
-
Tools to Support a Formal Verification Method for Systems with Concurrency and Nondeterminism
<p>With the availability of inexpensive computer hardware, software intensive systems are becoming sophisticated and pervasive, creating a need for software design methods that deliver robust and efficient systems. Unfortunately, most systems today are designed by trial and error, with designers …
-
An implementation of the parallelism, distribution and nondeterminism of membrane computing models on reconfigurable hardware
Membrane computing investigates models of computation inspired by certainfeatures of biological cells, especially features arising because of the presence ofmembranes. Because of their inherent large-scale parallelism, membrane computingmodels (called P systems) can be fully exploited only through …
-
On the role of nondeterminism and refinement in model-driven top-down development of software systems
… underspecification, but also persistent nondeterminism that is not to be resolved in refinements, as characterized by bisimulation equivalence on labeled transition systems. We show that such a setting is needed for process algebras if they specify concurrent systems, because concurrency …
-
Stochastic Dynamic Logics
… time ac- cording to probabilistic or Angelic nondeterminism. Stochastic Game Logic can be seen as extending PPDL with Demonic nondeterminism, or Game Logic with probabilistic nondeterminism. For both logics, we develop sound reasoning principals over the presented semantics.
-
Exposing and addressing machine learning brittleness through constraint solving
… can go unnoticed and are difficult to verify. Nondeterminism and inconsistency also introduce security vulnerabilities when output instability can be actively exploited by an adversary. To address these issues, this research introduces OCELOT, a framework that reduces nondeterminism and …
-
Parameterized Code Generation From Template Semantics
… template semantics allows for models containing nondeterminism, we introduce mechanisms for eliminating this nondeterminism when generating code. We describe Java implementations of several template-semantics composition operators that have no natural Java representations and give some techniques …
-
State minimization problems in finite state automata
… of the class of DFAs, allowing a small amount of nondeterminism; specifically two start states. Since nondeterminism allows finite automata to be more succinct, it is worthwhile to investigate the problem of minimizing such finite automata. In the case of unbounded non-determinism, i.e., NFAs, …
-
Angelic Processes
… formal modelling of systems, demonic and angelic nondeterminism play fundamental roles as abstraction mechanisms. The angelic nature of a choice pertains to the property of avoiding failure whenever possible. As a concept, angelic choice first appeared in automata theory and Turing machines, where …
-
Unambiguous Functions in Logarithmic Space
<p> The notion of nondeterminism is one of the most fundamental concepts in many areas of computer science. Unambiguity, requiring that there be at most one correct sequence of nondeterministic choices, has proved to be one of the most meaningful restrictions of nondeterminism. In the context of …
-
Deterministic Execution for Arbitrary Multithreaded Programs
Nondeterminism is one of the main reasons that parallel programming is so difficult. Bugs can vanish when programs are rerun or run under a debugger, thwarting attempts at their removal. Stress-testing is a common practice to flush out rare defects though it consumes extensive processing power and …
Page 1 of 5