PLCWorld is a closed‑loop execution environment and benchmark that evaluates large language model (LLM)–generated programmable logic controller (PLC) programs by coupling Structured Text (ST) execution with simulated plant responses and sensor feedback. It includes 100 synthetic tasks and 473 task‑condition pairs across Motion Control and Material Handling, with difficulty levels based on control‑dependency scope. The benchmark reports Task Success and Safety Violation separately and validates results through practitioner review, reference programs, counterexamples, and comparisons with independent ST runtimes, revealing performance differences among six LLMs and four generation‑and‑verification workflows.
arXiv:2607. 09713v1 Announce Type: new Abstract: A key step toward autonomous industrial operation is the ability to create and reconfigure control policies from natural-language requirement specifications, with minimal or no manual redesign.
The paper introduces the first benchmark suite for formal verification of PLC programs, covering both Structured Text and Ladder Diagram encodings of IEC 61131‑3. It contains 50 programs in 83 variants across ten industrial domains, each paired with a formal property, a machine‑checkable expected verdict, and a violation witness in SV‑COMP format. The suite’s ground‑truth methodology uses construction, fault injection, and cross‑tool consensus to ensure reliable verdicts, and the authors validate it with ESBMC and nuXmv, revealing format and semantics fragmentation in existing tools.
arXiv:2606. 28011v1 Announce Type: cross Abstract: We propose an agentic Large Language Model (LLM) framework for active Fault-Tolerant Control (FTC) that transforms fault detection outputs into constraint-aware recovery actions grounded in plant-specific knowledge.
CCTU is a new benchmark designed to evaluate large language models (LLMs) on their ability to use tools under complex constraints. It includes 200 test cases that average seven constraint types and 4,700‑token prompts, covering resource, behavior, toolset, and response dimensions. An executable validation module performs step‑level checks, and nine state‑of‑the‑art LLMs were tested, revealing that none exceed a 20% task completion rate when strict constraints are enforced, with frequent violations and limited self‑refinement.
arXiv:2606. 31252v1 Announce Type: new Abstract: Large language models can write plausible CAD scripts, but reliable industrial CAD modeling requires more than syntactically valid code: every feature, placement, and assembly relation must be accepted by an exact geometric kernel while remaining editable as parametric boundary representation geometry.
arXiv:2608.21417v1 Announce Type: new Abstract: Flexible manufacturing requires industrial robots to be reprogrammed rapidly as product variants change. This paper presents a language-model-based wor...
arXiv:2606. 07808v1 Announce Type: new Abstract: Reasoning language models deployed in agentic workflows must follow an instruction hierarchy: when instructions from different sources conflict, the model should obey the highest-privilege applicable instruction.
arXiv:2607. 22759v1 Announce Type: cross Abstract: Large language models (LLMs) show promise in code generation, but their capabilities to produce correct, synthesizable hardware description language (HDL) code still remain to be properly benchmarked.
arXiv:2606. 29700v1 Announce Type: new Abstract: Planning often requires symbolic specifications that are both executable and verifiable.
arXiv:2606. 00145v1 Announce Type: cross Abstract: Vision-language-action (VLA) agents can execute natural-language instructions, yet deployed systems still lack an operational interface: deciding when the instruction is complete.
CEDAR is a counterexample-guided framework that translates natural-language instructions for embodied agents into regular languages over environment event traces, represented as deterministic finite automata. By using a language model for semantic judgments and execution traces for correction, CEDAR turns constraints into executable finite-state objects, enabling the intersection of learned skills with additional specifications. In Minecraft experiments, CEDAR preserves temporal and spatial constraints better than a program-generating baseline and reduces cumulative LLM queries by reusing learned skills.
arXiv:2605.31478v2 Announce Type: replace-cross Abstract: Large language models (LLMs) can turn grid-analysis requests into executable programs for power-system simulation, but utilities and research...