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 84 for “"state machines"”.
-
Satisfiability Advancements Enabled by State Machines
This dissertation focuses on research for state-based Satisfiability (SAT), a variant of SAT that uses state machines (Smurfs) to represent constraints. Using this constraint representation allows for compact representations of SAT problem instances that retain more ungarbled user- domain …
-
Loop-free synthesis of finite state machines
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1964.
-
Improving Liquid State Machines Through Iterative Refinement of the Reservoir
<p>Liquid State Machines (LSMs) exploit the power of recurrent spiking neural networks (SNNs) without training the SNN. Instead, a reservoir, or liquid, is randomly created which acts as a filter for a readout function. We develop three methods for iteratively refining a randomly generated liquid …
-
Model reduction through an Hankel problem and finite state machines
(cont.) computation required to produce the approximation is O((n2Ì)/[epsilon]) where [epsilon] is the desired â[omega] error and n is the original system order.
-
Automated test sequence generation for finite state machines using genetic algorithms
… implementations, formally specified using finite state automata (FSA) has been of interest. Such systems include communication protocols and control sections of safety critical systems. There is extensive literature regarding how to formally validate an FSM based specification, but testing that an …
-
Dynamic model-based safety analysis: from state machines to temporal fault trees
Finite state transition models such as State Machines (SMs) have become a prevalent paradigm for the description of dynamic systems. Such models are well-suited to modelling the behaviour of complex systems, including in conditions of failure, and where the order in which failures and fault events …
-
FiniteFuzz : Finite State Machine Fuzzer For Industrial Control IoT Devices
… prevalent approaches. However, fuzzing Finite State Machines (FSMs) poses a significant challenge due to state and input dependency, resulting in exponential exploration time required to unlock the Finite State Machine. To address this issue, we present a novel approach in this research paper …
-
RSMLab : a web-based tool for recombinase-based state machine design and visualization
Biological state machines have the potential to enable a wide range of applications but until recently have been challenging to implement experimentally. To overcome this challenge, we described a scalable strategy for assembling biological state machines using recombinases. This platform enables …
-
Asynchronous algorithms for shared memory machines
… we introduce several asynchronous shared memory machines and design asynchronous algorithms for those machines. We first model asynchronous protocols for communication across unreliable channels using finite-state machines communicating via an unreliable shared memory. We establish lower bounds …
-
Methodology of refinement and decomposition in UML-B
… In particular, UML-B supports class diagrams and state machines, concepts that are not explicitly supported in plain Event-B. In Event-B, refinement is used to relate system models at different abstraction levels. The same abstraction-refinement concepts can also be applied in UML-B. This work …
-
CheckSync: Transparent Primary-Backup Replication for Go Applications Using Checkpoints
… to achieve this is through the use of replicated state machines, an approach in which the application is replicated across multiple machines. There could be as few as two in a primary/backup arrangement, or more to reduce the risk of downtime. Each instance starts in the same state, and then …
-
Learning to Verify Systems
… learning to verify safety properties of finite state machines communicating over unbounded first-in-first-out channels. (Abstract shortened by UMI.).
-
Trace analysis of protocols based on formal concurrent specifications
… which is based on single module extended finite state machines, handles both control and data flows for single module specifications. Symbolic evaluation is used to detect and delete infeasible paths that may be generated. Practical considerations which may occur in a real test environment, such …
-
Virtual infrastructure for wireless ad hoc networks
… present new algorithms based on the replicated-state-machine paradigm to implement these infrastructural components. In the second part of this thesis, I focus on the problem of developing virtual infrastructure for more realistic networks, in particular coping with the problem of unreliable …
-
Model-Based Testing of Smart Home Systems Using EFSM, CEFSM, and FSMApp
… were 52.22 million smart homes in the United States and they are expected to grow to 77.1 million in 2025 [71]. According to MediaPost [74], 69 percent of American households have at least one smart home device. The number of smart home systems poses a challenge for software testers to find …
-
Techniques for Developing Correct, Fast, and Robust Implementations of Distributed Protocols
… a novel scheme for incremental construction of state machines. The architecture was used to build a virtual memory system that is smoothly extended to support distributed shared memory.
-
Energy Efficient Hardware Accelerators for Packet Classification and String Matching
… matching include a new algorithm that builds a state machine that is used to search for strings with the aid of default transition pointers. The use of default transition pointers keep memory consumption low, allowing state machines capable of searching for thousands of strings to be small …
-
Empirical study of unstable leaders in Paxos
… and is often used for building replicated state machines. Safety is guaranteed by Paxos algorithm regardless of various machine and communication failures. However, the liveness is compromised when multiple Paxos leaders exist at the same time. Also, despite the extensive literature in the …
-
Neurosymbolic Learning for Robust and Reliable Intelligent Systems
… presents two classes of neurosymbolic models—state-machines and neurosymbolic transformers and evaluates them on two case studies—reinforcement-learning based autonomous systems and multirobot systems. These case studies showed that the learned neurosymbolic models are human-readable, can be …
Page 1 of 5