Cover Image

NetAgentBench: A State-Centric Benchmark for Evaluating Agentic Network Configuration

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Twabi, Ahmed, Ding, Yepeng, Kondo, Tohru
Format:	Preprint
Published:	2026
Subjects:	Networking and Internet Architecture Artificial Intelligence Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

It Takes a Village: Bridging the Gaps between Current and Formal Specifications for Protocols
by: Basin, David, et al.
Published: (2025)

Automata Size Reduction by Procedure Finding
by: Šedý, Michal, et al.
Published: (2024)

Formally Discovering and Reproducing Network Protocols Vulnerabilities
by: Crochet, Christophe, et al.
Published: (2025)

Tracer: A Tool for Race Detection in Software Defined Network Models
by: Caltais, Georgiana, et al.
Published: (2024)

Executable QR codes with Machine Learning for Industrial Applications
by: Scanzio, Stefano, et al.
Published: (2024)

Proving DNSSEC Correctness: A Formal Approach to Secure Domain Name Resolution
by: Zhang, Qifan, et al.
Published: (2025)

Automated Formal Verification of a Highly-Configurable Register Generator
by: Zhang, Shuhang, et al.
Published: (2024)

DRAMPyML: A Formal Description of DRAM Protocols with Timed Petri Nets
by: Christ, Derek, et al.
Published: (2026)

In-Memory Sorting-Searching with Cayley Tree
by: Paul, Subrata, et al.
Published: (2025)

Are Agents Probabilistic Automata? A Trace-Based, Memory-Constrained Theory of Agentic AI
by: Koohestani, Roham, et al.
Published: (2025)

Mechanics of Learned Reasoning 1: TempoBench, A Benchmark for Interpretable Deconstruction of Reasoning System Performance
by: Holzer, Nikolaus, et al.
Published: (2025)

Waiting Nets: State Classes and Taxonomy
by: Hélouët, Loïc, et al.
Published: (2022)

RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems
by: Jin, Hyundong, et al.
Published: (2025)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)

Combinatorics of nondeterministic walks
by: de Panafieu, Élie, et al.
Published: (2023)

Synthesizing Petri Nets from Labelled Petri Nets using Token Trail Regions
by: Bergenthum, Robin, et al.
Published: (2026)

Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
by: Latif, Saba, et al.
Published: (2025)

Correctness Notions for Petri Nets with Identifiers
by: van der Werf, Jan Martijn E. M., et al.
Published: (2022)

Robust and Attack Resilient Logic Locking with a High Application-Level Impact
by: Liu, Yuntao, et al.
Published: (2021)

Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)

Invariants and Home Spaces in Transition Systems and Petri Nets
by: Memmi, Gerard
Published: (2023)

Well-Formed Free-Choice Petri Nets Revisited
by: Jancar, Petr, et al.
Published: (2026)

Collaboration Miner: Discovering Collaboration Petri Nets (Extended Version)
by: Benzin, Janik-Vasily, et al.
Published: (2024)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

Probabilistic Modeling of Spiking Neural Networks with Contract-Based Verification
by: Yao, Zhen, et al.
Published: (2025)

Logic-Gated Time-Shared Feedforward Networks for Alternating Finite Automata: Exact Simulation and Learnability
by: Dhayalkar, Sahil Rajesh
Published: (2026)

Operational State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)

On the Representation and State Complexity of Block Languages
by: Duarte, Guilherme, et al.
Published: (2024)

Computability of Agentic Systems
by: Viriyasuthee, Chatavut
Published: (2026)

Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
by: Yu, Qixian, et al.
Published: (2025)

Exact Accepting-State Spectrum for Reversal of Permutation Automata
by: German, Samuel
Published: (2026)

Languages of Boundedly-Ambiguous Vector Addition Systems with States
by: Czerwiński, Wojciech, et al.
Published: (2025)

Fast and General Automatic Differentiation for Finite-State Methods
by: Yang, Lucas Ondel, et al.
Published: (2026)

Efficient Constructions of Finite-State Independent Normal Pairs
by: Pulari, Subin
Published: (2026)

Networks of Moore Machines
by: Yodaiken, Victor
Published: (2015)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)

Verification and Enforcement of Strong State-Based Opacity for Discrete-Event Systems
by: Han, Xiaoguang, et al.
Published: (2024)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

Synthesis of State-Attack Strategies for Anonymity and Opacity Violation in Discrete Event Systems
by: Li, Xiaoyan, et al.
Published: (2025)