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 47 for “"Finite state machines"”.
-
Loop-free synthesis of finite state machines
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1964.
-
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 …
-
FiniteFuzz : Finite State Machine Fuzzer For Industrial Control IoT Devices
… the most 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 …
-
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 …
-
Learning to Verify Systems
… we use 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
… model, 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 …
-
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 …
-
Complementary formalisms - synthesis, verification and visualization
… models, we developed a method of synthesizing finite state machines from Object-Z models with history invariants. For system development starting with diagrams, we investigated ways of synthesizing distributed object systems from Live Sequence Charts. By combining the two approaches, we achieve …
-
Diastolic arrays : throughput-driven reconfigurable computing
… from high-level specifications of communicating finite state machines, providing a high-performance, off-the-shelf computer substrate that can be easily programmed.
-
Random search of AND-OR graphs representing finite-state models
… concurrent software represented by communicating finite-state machines. But these tools may require a very large amount of memory. A finite-state model can be translated automatically into a compact AND-OR graph. We use an abductive random search scheme to extract, from the AND-OR graph, …
-
A finite state machine framework for robust analysis and control of hybrid systems
… and certification of systems with discrete, finite-valued actuation and sensing. This approach is inspired by classical robust control, and is based on the use of finite state machines as nominal models of the hybrid systems. The development does not assume a particular algebraic or …
-
Digital pulse processing
… deterministic and built from simple asynchronous finite-state machines that can perform general piecewise-linear operations. The pulses can then be converted back into an analog or fixed-point digital representation through a filter-based reconstruction. Integrate-and-fire is shown to be …
-
Hybrid control architecture for navigation of autonomous mobile robots
… and hybrid behavioural encoding incorporating stateflow-fuzzy logic and stateflow-neural networks. The deliberative system is comprised of finite state machines. The processing is achieved in a centralised and/or decentralised manner using the proposed controller-agent concept from the field of …
-
A Domain-Specific Language for Traceability in Modeling
… languages (User Requirements Notation and Finite State Machines). This work hence contributes a reliable mechanism to define and support traceability between requirements and models.
-
Simulation and mathematical notation of alarms unit for computer assisted resuscitation algorithm
… high and low blood pressure. Using the alarms finite state machine already provided simulation of the alarms unit was done. The alarms finite state machine was constructed by using the requirements [2] provided by WRAIR [Walter Reed Army Institute of Research]. A mathematical specification was …
-
Design of a cooperative overtaking algorithm for platoons on freeways
… theoretically define the algorithm by the use of Finite State Machines (FSMs) and implement it into a simulation environment. Thorough testing of the algorithm within the simulation environment shows that it works not only as expected, but can also avoid or handle possibly dangerous traffic …
-
Artificial Conversations for Chatter Bots Using Knowledge Representation, Learning, and Pragmatics
… process is modeled using stochastic finite state machines, where the parameters of the model are learned from a corpus of human conversations. This research leverages specific concepts from conversation theory and speech act theory. For evaluation purposes, the artificial …
-
An Abstract Complexity Theory for Boolean Functions
… is used to characterize the computations of finite state machines.
-
The VAT tool : automatic transformation of VHDL to timed automata
… tool, that transforms VHDL specifications into finite state machines. It discusses the use of model checking on the extracted formal model and presents a visualization technique that enables manual inspection of the formal model.
Page 1 of 3