Chapter Four · failure evidence

What Finite State Machines & Logic Control got wrong, from 92 dissertations

The records evaluate finite state machine designs, discrete logic control, and formal state space verification across computational and physical systems. Common failures include combinatorial state space explosion, modeling mismatches when applying discrete logic to continuous dynamics, and architectural overhead in complex transition networks. These records come from PhD theses at 24 institutions, 2021 to 2026. Each links to its thesis. They were extracted by language models reading the full text, so treat each as a lead to read, not a verdict.

Combinatorial state space explosion prevents formal verification and automaton determinization

27 theses · 13 institutions

Converting nondeterministic automata or exploring explicit states leads to memory exhaustion and intractable state counts during formal verification. Precomputing contingency sequences, model checking concurrent protocols, and unabstracted reachability analysis consistently exceed computational limits.

Tried and failed

NFA to DFA determinization applied to network protocol state tracking. Outcome: infeasible cost. Reason: State-space explosion during automaton determinization resulted in an unacceptably large automaton size.

A state machine approach for network intrusion detection · Iowa State

Tried and failed

exhaustive explicit-state model checking without model reduction applied to concurrent communication protocol specifications. Outcome: infeasible cost. Reason: state space explosion caused the model checker to exceed available system memory

Verification of a communication protocol for the space environment: A case study · Iowa State

Tried and failed

abstract finite tree automaton synthesis applied to inverse constructive solid geometry synthesis. Outcome: infeasible cost. Reason: state space explosion during refinement when handling repeating geometric patterns

Inductive and Deductive Synthesis for Database Applications · MIT

Tried and failed

nondeterministic state monad with relational satisfiability applied to processor and compiler formal verification. Outcome: infeasible cost. Reason: existential quantifiers generated at every intermediate monadic bind caused massive formula explosion

Techniques for Foundational End-to-End Verification of Systems Stacks · MIT

Tried and failed

full disjunctive state joining applied to static analysis state space exploration. Outcome: did not converge. Reason: excessive precision caused unbounded state explosion, preventing fixpoint convergence

Low-Level Static Analysis for Memory Usage and Control Flow Recovery · Virginia Tech

Tried and failed

converting nondeterministic extended finite automata to deterministic applied to pattern matching with variables. Outcome: infeasible cost. Reason: variable domains and wildcards cause exponential state space explosion during determinisation

A specification-based approach for intrusion detection Specification based approach for intrusion detection · Iowa State

Tried and failed

brute-force enumeration of surjective mappings applied to finite state machine homomorphism equivalence. Outcome: infeasible cost. Reason: testing all permutations causes combinatorial explosion

TOWARD A ROBUST COMPUTATIONAL SOLUTION FOR FORMAL VERIFICATION AND VALIDATION IN MODEL-BASED SYSTEMS ENGINEERING · Georgia Tech

Tried and failed

explicit-state model checking applied to concurrent synchronization protocols. Outcome: infeasible cost. Reason: state space explosion caused the checker to run out of memory after exploring over 300 million states

Specifying and Verifying Imperative Models of Operating System Structures · Harvard

Tried and failed

exhaustive offline precomputation of contingency backup allocations applied to fault-tolerant distributed network design. Outcome: infeasible cost. Reason: combinatorial explosion of failure sequences causes factorial state space growth and memory exhaustion

Optimization-based design of fault-tolerant avionics · Georgia Tech

Tried and failed

formal verification without input domain abstraction applied to closed-loop control system models. Outcome: too slow. Reason: State space explosion on full unconstrained input ranges prevented proof completion within 24 hours.

Case study of model-based validation & verification of an agricultural crop engaging control system · Iowa State

Tried and failed

constraint compilation of state machine transitions applied to large deterministic finite automata. Outcome: infeasible cost. Reason: memory exhaustion from encoding large transition functions into constraints

Correct Programs, Executed Correctly: Verifying Specifications And Executions · Penn

Lost to a baseline

Predicate abstraction yielded worse state counts and higher runtimes than tropical abstraction when matrix rows contained m > 2 finite entries.

Abstractions and formal verification of max-plus linear systems · Oxford

Considered and rejected

Considered and rejected: Finite State Machines (FSMs) for complex autonomous AAV behavior, rejected due to geometric/exponential growth in state transitions (n^2 or 2^n), fragility, poor runtime adaptability, and reduced debugging transparency

AERO: A Neo-Darwinian Approach to Time-Energy Optimal Behavioral Robotics · Harvard

Considered and rejected

Considered and rejected: Rejected centralised product CTMC optimization for global multi-robot task allocation due to state explosion rendering it intractable.

Right place, right time: proactive multi-robot task allocation under spatiotemporal uncertainty · Oxford

Considered and rejected

Considered and rejected: Rejected using classical Dynamic Fault Tree Analysis (DFTA) or semi-Markov models for reliability due to severe state space explosion.

Towards a generic framework for extending system architectures of autonomous vehicles with a self-managing functionality · DSpace-CRIS at TU Wien

Considered and rejected

Considered and rejected: Rejected direct continuous PK/PD ODE modeling inside CEFSM/UPPAAL because state space explosion made formal verification intractable

Medical Device Interoperability With Provable Safety Properties · Penn

Considered and rejected

Considered and rejected: Rejected Markov models because of constant-rate memoryless assumptions and state space explosion when modeling complex interacting asset sub-processes

Renewals scheduling for high-speed railway assets · University of Nottingham Repository

Considered and rejected

Considered and rejected: Rejected standard Markov Processes because they require constant transition rates (exponential distributions) and suffer from state-space explosion.

Risk modelling of safety critical systems for life extension in offshore oil and gas · University of Nottingham Repository

Considered and rejected

Considered and rejected: Rejected centralized multi-robot active information acquisition due to exponential state-space growth and excessive runtime/memory requirements

MOBILE MISSION PLANNING IN UNCERTAIN ENVIRONMENTS · Penn

Considered and rejected

Considered and rejected: Rejected encoding fine-grained robot movement times directly into the Spectra LTL/GR(1) specification because time discretization caused severe state-space explosion.

Automation of Multi-Robot Choreography Planning in Automotive Production · Leibniz Universität Hannover Repository

Considered and rejected

Considered and rejected: Rejected allowing nodes to make pseudo-random choices via state seeds or exposing handler non-determinism to the model checker due to massive state graph explosion.

Techniques for Integrating Erasure Codes and Model Checkers with Distributed Systems · ResearchWorks

Considered and rejected

Considered and rejected: Rejected offline lookup-table and grid-discretized MDP approaches due to continuous state explosion and inability to handle dynamic intruder counts

Learning-based decision making for safe and scalable autonomous separation assurance · Iowa State

Considered and rejected

Considered and rejected: Rejected full state-space enumeration in Dynamic Programming due to combinatorial explosion ((N!)^T states), rendering it computationally intractable for N > 12 facilities.

Dynamic Facility Layout for Cellular and Reconfigurable Manufacturing using Dynamic Programming and Multi-Objective Metaheuristics · Scholarship at UWindsor Institutional Repository

Considered and rejected

Considered and rejected: Rejected standard full state-space MDP modeling for reconfigurable optimization due to action-dependent state space explosion (up to N*A states).

Robust solution schemes for clustering and decision-making problems under uncertainty · UT Austin

Considered and rejected

Considered and rejected: Rejected standard analytical/matrix-equation solutions (e.g. reachability graphs) for stochastic Petri nets due to intractable state-space explosion on large complex systems.

Modelling safety critical systems with ageing components, with application to underground railway risk and hazards · University of Nottingham Repository

Considered and rejected

Considered and rejected: Rejected non-symbolic finite state transducers because storing look-ahead context for 2^32 alphabets causes state explosion.

Programming Using Automata and Transducers · Penn

Considered and rejected

Considered and rejected: Rejected exact encoding of multi-robot continuous dynamics in high-level activity planning, as joint state space scales exponentially beyond memory limits.

Hybrid Concurrent Planning with Heterogeneous Robot Teams for Timed Goals · MIT

Discrete state abstractions and linearized logic fail on continuous nonlinear dynamics

13 theses · 11 institutions

Discrete state machines and 1D lookup tables cannot capture coupled continuous state variables or multidimensional nonlinear dynamics. Simplified linearizations and deterministic assumptions lead to constraint violations, uncontrollable state modes, and policy instability on switched or continuous physical plants.

Tried and failed

1D lookup table for non-linear control mapping applied to vehicle lateral steering dynamics model. Outcome: did not generalise. Reason: failed to capture coupling and gain variation dependent on a second state variable (speed)

Parameter Identification and Validation of a Control-Oriented Vehicle Dynamics Model for an Autonomous Chevrolet Bolt EUV · Virginia Tech

Tried and failed

state machine control applied to hybrid power management. Reason: designed for discrete inputs rather than continuous dynamic systems

Intelligent-based hybrid-electric propulsion system for aero vehicle · Cranfield

Tried and failed

monotonicity assumptions for formal state abstraction applied to autonomous system safety verification. Outcome: did not generalise. Reason: monotonic safety ordering fails near boundary regions of control and perception

SCALABLE AND RISK-AWARE VERIFICATION OF LEARNING ENABLED AUTONOMOUS SYSTEMS · Penn

Tried and failed

single-input feedback control for multidimensional nonlinear systems applied to oversteering dynamics in all-wheel drive vehicles. Outcome: unstable. Reason: a remaining unstable velocity state mode is uncontrollable via scalar total drive torque alone

Influence of the drive torque distribution on vehicle handling and stability · DSpace-CRIS at TU Wien

Tried and failed

dynamic mode decomposition with control applied to spatiotemporal state reconstruction. Outcome: did not generalise. Reason: training data did not excite the specific control actuator active during testing

Development of a digital twin for online state reconstruction in TRIGA reactors · UT Austin

Tried and failed

deterministic optimization ignoring system parameter uncertainty applied to spacecraft thermal control system design. Outcome: did not generalise. Reason: optimizing solely for nominal operating conditions resulted in constraint violations across most uncertain operating states

Adaptive and Responsive Design Under Uncertainty for Resource-Constrained Small Satellites · MIT

Tried and failed

certainty equivalent model predictive control applied to controlled environment greenhouse climate control. Outcome: unstable. Reason: unhandled disturbance forecast and model linearization errors caused severe state constraint violations

CYBER-PHYSICAL-BIOLOGICAL SYSTEMS FOR ENERGY-EFFICIENT CONTROLLED ENVIRONMENT AGRICULTURE · Cornell

Tried and failed

classical energy function stability analysis applied to power systems with inverter-based resources. Outcome: did not generalise. Reason: state-dependent non-positive damping from PI-controlled phase-locked loops causes overestimation of the region of attraction

Transient stability analysis of power systems containing grid-following inverters · Imperial

Tried and failed

deterministic policy gradient applied to state-dependent switched systems. Outcome: unstable. Reason: discontinuous and non-differentiable control landscapes cause high gradient variance and bias

Optimal Control of State-Dependent Switched Systems · Georgia Tech

Tried and failed

static constraint reduction on dynamic optimization models applied to PDE boundary control formulation. Reason: omitted non-redundant state-dependent conditions under time-varying parameters, producing incorrect physical solutions

On traffic state estimation and control in the world of connected vehicles · UT Austin

Tried and failed

linearized state-feedback control applied to bistable nonlinear reaction-diffusion PDEs. Outcome: unstable. Reason: linearization failed to capture nonlinear dynamics, allowing trajectories to escape toward an alternate stable steady state

Control of agent-based models across scales · Imperial

Considered and rejected

Considered and rejected: Optimal control rejected due to strict requirement for accurate models and full state availability; Non-interactive control rejected due to excessive gain requirements.

MULTIVARIABLE STABILIZER FOR A MULTIMACHINE PLANT · HARVEST

Considered and rejected

Considered and rejected: Rejected standard value function / Q-learning approaches because transients in power dynamics violate the stationary state distribution assumption.

Structured Control and Learning for Sustainable Power Systems · ResearchWorks

Discrete state tracking models fail under non-stationary dynamics and unmodeled shifts

12 theses · 7 institutions

Keyword heuristics, discrete hidden Markov models, and static binary thresholds fail to track conversational states or adapt to abrupt reliability shocks. These tracking mechanisms produce unnatural conversational loops, drop critical latent updates, or trigger excessively rapid state switching without appropriate priors.

Tried and failed

keyword-based regular expressions for dialogue state management applied to multi-turn conversational role-play systems. Reason: ignoring conversational history caused unnatural turn transitions and state inconsistencies

Development and validation of spoken dialog system-based oral communication tasks in an ESP context · Iowa State

Tried and failed

deterministic state transitions in hierarchical decision processes applied to hierarchical sequential game-theoretic learning models. Reason: degenerate extreme probabilities eliminate future divergence events required for higher-level updates and state revision

The Supreme Court: Peacemaker or Drama Queen? A Model of Judicial Precedent · Harvard

Tried and failed

discrete binary state failure modeling applied to system safety and reliability requirement allocation. Reason: binary states fail to capture functional degradation, biasing architecture design and distorting component requirements

An Integrated Framework to Evaluate Off-Nominal Requirements and Reliability of Novel Aircraft Architectures in Early Design · Georgia Tech

Tried and failed

discrete Hidden Markov Model sequential state prediction applied to human compliance dynamics under system errors. Outcome: did not generalise. Reason: model fails to capture sudden non-stationary state shifts caused by negative reliability shocks

Human-Robot Trust in Time-Sensitive Scenarios · Georgia Tech

Tried and failed

counterexample-guided abstraction refinement applied to partial-information game synthesis. Outcome: worse than baseline. Reason: automated refinement heuristics produce non-minimal abstract state spaces compared to manual domain-specific abstractions

Assured decison-making for autonomous systems · UT Austin

Tried and failed

hierarchical joint state-dependent engagement logic applied to multi-component nonlinear mechanical damper simulation. Outcome: worse than baseline. Reason: overestimated engagement ratios and converged more slowly than independent component checks

Vibration Reduction and Energy Harvesting using Motion-Rectified Tuned Mass-Damper-Inerters in Semi-Submersible Offshore Wind Platforms · Virginia Tech

Tried and failed

incremental bounded model checking with state reuse applied to formal specification verification. Outcome: worse than baseline. Reason: a single unsatisfiable command prevented execution reduction through slicing or state reuse

Improving formal reasoning for software systems using machine learning and symbolic approaches · UT Austin

Tried and failed

gendered conversational agents for product recommendation applied to e-commerce purchase intention. Outcome: worse than baseline. Reason: dialogue state management failures and conversational loop errors

Can (S)He Close the Deal? The influence of Purchase Intention Through Gender-Assigned Artificial Intelligence · Virginia Tech

Tried and failed

empowerment-based goal-agnostic assistance applied to multi-step collaborative household tasks. Outcome: worse than baseline. Reason: optimizing state reachability provides insufficient guidance compared to inferring specific human goals in complex tasks

VirtualHome: Building Socially Intelligent Agents via Simulation · MIT

Tried and failed

state-change thresholding for conditional recurrent updates applied to asynchronous event stream processing. Outcome: worse than baseline. Reason: setting the threshold too high skipped essential latent updates, severely degrading representation quality

Efficient processing of temporally asynchronous and spatially unstructured event-based camera data · Georgia Tech

Considered and rejected

Considered and rejected: Rejected static binary/discrete Current Attention state thresholds alone as too rigid for long-term narrative/environmental evolution across scenes.

Attention-driven scenography · University of Nottingham Repository

Considered and rejected

Considered and rejected: Rejected unconstrained State-Space Models without Dirichlet transition priors in the point-process HMM because baseline state labels switched unrealistically fast.

Statistical Modeling of Disrupted Sensory Processing during Propofol Mediated Unconsciousness · MIT

Transition graph complexity and rigidity hinder flat and handcrafted state machine architectures

9 theses · 8 institutions

Flat finite state machines and rule sets suffer from quadratic transition growth and lack adaptability compared to modular structures such as behavior trees. Manual authoring of extensive transition graphs or nested conditional branches creates heavy execution overhead and becomes visually incomprehensible.

Considered and rejected

Considered and rejected: Rejected traditional sense-think-act rule-based architectures / FSMs because state transitions and rule sets grow quadratically (O(n^2)) and fail to generalize to unmodeled behaviors.

Agent for Autonomous Driving based on Simulation Theories · IRIS - UNITN - prod

Tried and failed

Nested conditional branching for parameter lookup applied to dynamic laser power modulation arrays. Outcome: too slow. Reason: Evaluating thousands of sequential conditional statements introduced massive interpreter and execution overhead during fabrication

3D diffractive optics for linear interconnects and nonlinear processing · EPFL

Tried and failed

recursive state machine folding for automata verification applied to pattern matching on small inputs. Outcome: worse than baseline. Reason: per-step recursive proof overhead and match checking exceeded the cost of simple execution

Correct Programs, Executed Correctly: Verifying Specifications And Executions · Penn

Considered and rejected

Considered and rejected: Rejected conventional Ladder Logic Diagrams (LLDs) and PLCs for flexible conveyor control due to inability to support on-line dynamic reconfiguration without halting

STEPS TOWARDS ADVANCED CELL CONTROL SYSTEMS : AN APPLICATION IN FLEXIBLE ASSEMBLY SYSTEMS · De Montfort Open Research Archive (DORA)

Considered and rejected

Considered and rejected: Rejected hardwired TTL scanning logic of the prior 32-channel controller in favor of modular microprocessor-based software control

A microprocessor-based experiment controller for the VPI & SU satellite tracking station · Virginia Tech

Considered and rejected

Considered and rejected: Rejected Hierarchical Finite State Machines (HFSMs) for agent cognitive control due to exponential transition complexity (states squared) and hard-coded lack of adaptiveness, selecting Behavior Trees instead.

A Methodology for the Virtual Quantification of Operator Workloads in Support of Partially-Automated System Analysis · Georgia Tech

Considered and rejected

Considered and rejected: Rejected handcrafting full dialogue trees/rules due to high human effort and being error-prone for large state spaces.

Automating the Generation of Goal-Oriented Dialogue Managers for Healthcare · IRIS - UNITN - prod

Considered and rejected

Considered and rejected: Rejected single-level flat FSMs for complex clinical workflows in favor of hierarchical FSMs with isolated State Branches to prevent transition complexity explosion.

Physical AI via Hierarchical Decision Processes · JScholarship

Considered and rejected

Considered and rejected: Rejected unorganized flat Boolean state flags scattered across scripts/callbacks for workflow management in favor of explicit hFSM representations.

Physical AI via Hierarchical Decision Processes · JScholarship

Considered and rejected

Considered and rejected: Rejected state transition graph interface for large models because it becomes cumbersome and incomprehensible after a few dozen states/events compared to tables.

A Finite State Machine CASE Tool · TXST Digital Repository

State contamination and transition penalties degrade sequential and switched control

9 theses · 6 institutions

Evaluating sequential subtasks or policies without resetting state leads to state contamination, estimation errors, and physical instability. Discrete switching and frequent power state cycling also introduce heavy backup overhead, prolonged settling times, and predictable cluster patterns.

Tried and failed

sequential policy evaluation without state resets applied to simulated autonomous navigation. Outcome: unstable. Reason: state contamination between evaluation runs caused divergent physics and metastability hazards

Brain-Inspired Drone Navigation Using the Conflict Architecture · Virginia Tech

Tried and failed

sequential model predictive control across hierarchical subtasks applied to multi-stage robotic navigation and docking. Outcome: unstable. Reason: open-loop subtask transitions caused severe failure under state estimation errors

Autonomous mobile rescue robot for casualty extraction · Imperial

Tried and failed

low fixed turn-on voltage threshold applied to intermittent computing edge inference. Outcome: worse than baseline. Reason: frequent power cycles increased state backup and recovery overhead, reducing total completed tasks

Adaptive and Intelligent Battery-free Computing Systems: Platforms, Runtime Systems, and Tools · Georgia Tech

Tried and failed

joint multi-scenario parameter optimization across diverse conditions applied to linear power flow approximations. Outcome: worse than baseline. Reason: a single static parameter set cannot simultaneously fit divergent nominal and contingency operating states

Improving Power System Approximations Through Machine Learning-Inspired Optimization Methods · Georgia Tech

Tried and failed

static sleep voltage assignment applied to dynamic power management. Outcome: worse than baseline. Reason: fixed parameters fail to track runtime optimal energy states, causing higher energy loss

Runtime Control and Optimization Techniques for SoC Power Management · Georgia Tech

Tried and failed

physics-calibrated time-symmetric control pulses applied to waveguide state transfer efficiency. Outcome: worse than baseline. Reason: signal line distortions and impedance mismatches broke theoretical symmetry assumptions

Quantum Networking using Waveguide Quantum Electrodynamics · MIT

Tried and failed

discrete topological switching for moving target defence applied to power grid state obfuscation. Reason: discrete state transitions produce separable clusters easily identified by unsupervised clustering algorithms

Operational moving target defences for improved power system cyber-physical security · Imperial

Considered and rejected

Considered and rejected: Rejected explicit switch state resets between test sequences in FP4 due to severe performance degradation

Network-Wide Monitoring And Debugging · Penn

Considered and rejected

Considered and rejected: Zero-duty setting on lower-power AVQ switch rejected because it increases settling time during power balancing state transitions.

Modular Photovoltaic (PV) Step-up Converter With A Coupled Power Balancing Scheme for DC-Distributed System · YorkSpace

Hardware logic synthesis and control path compilation introduce latency and area overhead

8 theses · 7 institutions

Unadapted polyhedral optimizations and static schedule unrolling generate complex control logic and redundant state bridges that inflate execution time. General logic decomposition and dynamic bypass logic fail to match the critical path delays and power reduction of specialized hardware baselines.

Tried and failed

Static schedule unrolling for execution ordering applied to large-scale hardware simulation models. Outcome: worse than baseline. Reason: exponential explosion of state bridges from data-dependent branch permutations in update blocks

PRODUCTIVE AND EXTENSIBLE HARDWARE MODELING, SIMULATION, AND VERIFICATION METHODOLOGIES · Cornell

Tried and failed

direct polyhedral compiler optimization for high-level synthesis applied to hardware acceleration of benchmark C loops. Outcome: worse than baseline. Reason: direct unadapted polyhedral transformations generate complex control logic inflating execution wall-time

Tools for efficient Deep Learning · Imperial

Tried and failed

hierarchical multi-module generation prompting applied to simple hardware logic design. Outcome: worse than baseline. Reason: enforcing modular decomposition on inherently simple tasks introduced unnecessary complexity compared to single-module prompts

Harnessing Large Language Models Towards More Accessible Hardware Accelerator Design · Georgia Tech

Tried and failed

logic synthesis mapping for quantum circuit compilation applied to reversible permutation and Toffoli circuit benchmarks. Outcome: worse than baseline. Reason: general logic decomposition lacks domain-specific direct gate optimizations present in specialized baselines

Optimizing Quantum Compilers: Efficient and Effective Algorithms · EPFL

Lost to a baseline

Vivado baseline achieved better run-time critical path delay than Reticle on the control-oriented finite state machine (fsm) benchmark across states 3, 5, 7, and 9

Programming Abstractions and Efficient Compilation Techniques for Modern FPGAs · ResearchWorks

Lost to a baseline

PDL Bypass Queue lock introduces a dynamic priority calculation and redundant state overhead compared to Sodor's static bypassing logic.

LANGUAGE–BASED TECHNIQUES FOR BUILDING TIMING CHANNEL SECURE HARDWARE–SOFTWARE SYSTEMS · Cornell

Tried and failed

simulated annealing optimization applied to state assignment for logic minimization. Outcome: worse than baseline. Reason: achieved less power reduction on average than deterministic greedy search heuristics

State encoding for low power · Iowa State

Lost to a baseline

Computation time increased by around 30% for the 5-state Markov model compared to the 2-state model for only a 1% gain in harvested energy.

Power management for energy harvesting · Cranfield

Controllers lacking integral action suffer from steady state error and slow settling

5 theses · 5 institutions

Pure proportional and fuzzy logic controllers produce non-zero steady-state tracking errors and offsets that classical integral action eliminates. Lag in thermal or high-inertia systems causes continual cycling and extended correction times when switching between discrete heating and cooling states.

Tried and failed

proportional-integral feedback control applied to systems with high thermal inertia. Outcome: worse than baseline. Reason: continual cycling between heating and cooling states due to system response lag

Indoor and outdoor radiant cooling systems for buildings · UT Austin

Lost to a baseline

Fuzzy logic controllers and GA showed slightly inferior steady-state accuracy compared to classical PI, where the integral action completely eliminates steady-state error.

Technique Avancées pour la Commande d'un Système de Conversion Eolien · DSpace at University of El Oued

Lost to a baseline

Algebraic IDA-PBC exhibited non-zero steady-state current tracking error upon grid inductance variations, whereas the conventional PI controller maintained zero steady-state error.

Synchronization stability analysis and control of grid-connected wind farms · Imperial

Lost to a baseline

Variable control took substantially longer to correct for overshoot and reach steady-state conditions than on/off control during a 10-degree step change test.

Variable output heater control for unvented heaters used in livestock housing · Iowa State

Considered and rejected

Considered and rejected: Using proportional action only (P controller) was rejected because the controlled variable operated with an offset/steady-state error.

Optimal energy management for electric aircraft. · Cranfield

Left open by the authors

Problems the authors named and did not get to.

Left open

Extend the fault injection framework to support multi-fault and cascading failure injection without exponential state space explosion. Blocker: No concrete algorithmic approach or reduction technique is specified for mitigating combinatorial state explosion.

Efficient Fault Injection for Exposing and Reproducing Failures in Cloud Systems · JScholarship

Left open

Model high-order and long-term sequential dependencies in Markov chains for recommendation while mitigating state space explosion. Blocker: No specific approach, mathematical formulation, or mitigation technique is defined to handle the state explosion

Semantic Embedded Sequential Recommendation for E-Commerce Products through Mining Customers’ Historical Interactions and Products’ Data · Scholarship at UWindsor Institutional Repository

Left open

Develop non-exponential synthesis algorithms for Event-based STL specifications that avoid Büchi automaton state explosion. Blocker: No concrete algorithmic approach or mechanism is specified to overcome the exponential complexity.

Event-Based Signal Temporal Logic Synthesis for Single and Multi-Robot Tasks · Cornell

Left open

Develop scalable Markov model approximations for multi-body robotic swarms to mitigate exponential state-space growth. Blocker: None

Design, modeling, and optimization of robots exploiting fluid structure interactions · EPFL

Left open

Extend the SMT- and BDD-based fault-tolerant design space exploration framework to handle dynamic state evolution and dynamic faults. Blocker: The task is described as an abstract research direction without a concrete mathematical approach or target specification

Automatic Design Space Exploration of Fault-tolerant Embedded Systems Architectures · IRIS - UNITN - prod

Left open

Extend the FAVER reasoning framework to handle dynamic states, sensor faults, control system faults, and multiple concurrent faults. Blocker: FAVER framework codebase and model implementations are not publicly available

A framework for aerospace vehicle reasoning (FAVER) · Cranfield

Left open

Develop long-horizon memory maintenance and consistent state representation mechanisms for robot manipulation perception and planning. Blocker: The task is an open-ended research direction without specific architectural requirements, metrics, or benchmarks defined.

Generalizable Robot Manipulation through Unified Perception, Policy Learning, and Planning · MIT

Left open

Develop a hybrid model-and-data-based fault identification technique to identify root-cause variables in extended dynamical state-space models. Blocker: Vague task specification without concrete formulations, targets, or algorithms

Fault Detection and Identification of Large-scale Dynamical Systems · MIT

Left open

Automate probabilistic separation logic verification by synthesizing probabilistic loop invariants for general programs. Blocker: Lacks specific algorithm design, target verification framework, or formal heuristics for invariant synthesis

PROBABILISTIC SEPARATION LOGICS FOR RANDOMIZED ALGORITHMS · Cornell

Left open

Evaluate encoded state check error detection on mobile autonomous systems in distributed dynamic traffic settings via simulation. Blocker: Lack of specific evaluation metrics, experimental setups, or target autonomous system models

REAL-TIME ERROR DETECTION AND CORRECTION FOR ROBUST OPERATION OF AUTONOMOUS SYSTEMS USING ENCODED STATE CHECKS · Georgia Tech

Checking a claim in this area?

We can run the same search on any method or claim. If nothing turns up, we will say so, and that proves nothing on its own.