We have developed the MAL Simulator, a cyber operation simulator based on the Meta Attack Language (MAL). The MAL Simulator is intended for decision-driven cyber attack and defense simulations, for system analysis and the development of automated agents. By building the simulator around an attack modeling language, it can be adapted to different target domains without modifying the source code. We used the simulator for two case studies where we trained two types of agents for automated cyber operations: a defensive agent and an offensive agent. To ground the experiments, we base the models in data collected from an emulated network implemented in the cyber range CRATE. We found that the trained attacker policy could reach the designated targets more efficiently than the compared search methods, and that the trained defender agent induced lower costs than a naive heuristic agent under noisy alert conditions. When testing the RL attacker against the RL defender, we found that the performance of the defenders dropped significantly. This emphasizes the importance of cyber attack simulators to facilitate training both offensive and defensive agents. The MAL Simulator and associated tooling is publicly available and provides common interfaces for compatibility with existing machine learning frameworks.
Figures & tables
Figure 1: Overview diagram of the modeling and simulation structure.
[restart, respect-blocks] Property
MAL Simulator
Intent
Scenario-dependent; Specified Attack steps
Opportunities
Language-dependent
Capabilities
Language-dependent; Traversable steps
Preference
Agent-dependent
\Block 2-1Sophistication
\Block 2-1Customizable through
language and ttc ( ttc )
Table 1: Adversary classification via the COPSI framework.
Property
MAL Simulator
Intent
Scenario-dependent; Cost-minimization
Opportunities
Language-dependent; Defense steps
Capabilities
Language-dependent; Unused defenses
Preference
Agent-dependent
Sophistication
Customizable through language
Table 2: Defender classification via the COPSI framework.
[restart, respect-blocks] Property
MAL Simulator
Overall Abstraction
Language-dependent; High
\Block 1-2 Topology
Dynamic Changes
Under Development
\Block 2-1Representation
Directed Graph;
Undirected Graph
\Block 1-2 Network
Table 3: Comparison of simulation model attributes structured by the SICTO framework.
Figure 2: Language graph of simple mal language. Nodes represent attack step types, with the directed edges indicating dependencies between them.
Figure 3: Topology of the AIR-DELIVERY-SYSTEM24 (ADS-24) computer network represented as a graph with nodes representing hosts and subnets, and edges network connectivity. Windows hosts are denoted with green rectangles and Linux host with orange ovals.
Figure 4: Graph representation of mal instance model, based on Osquery data from the hosts “ntp” and “payroll” , with asset types and relations from CadsLang.
Figure 5: Average return for rl attacker during training.
Agent Type
Return
DFS
−797±15.4
Random
−736±12.6
BFS
−717±12.8
PPO
−301±10.3
Table 4: Returns (mean ± 95% CI) after evaluating attacker agents for 10 episodes on each of the 15 test scenarios with the mal Simulator.
Figure 6: Violin plot of episode lengths after evaluating attacker agents for 100 episodes for 10 episodes on each of the 15 test scenarios. The median is indicated as a dashed line, and the mean as a solid line.
Figure 7: Scaled returns for rl defender agents during training.
Agent
FPR
Return (Mean ± Std)
Heuristic
0%
-6147 ± 5291
NoOP
0%
-81009 ± 39058
Vejde
0%
-6501 ± 5372
Vejde w/ Noise
0%
-9614 ± 7976
Heuristic
1%
-61653 ± 914
NoOP
1%
-81336 ± 39850
Table 5: Mean return with standard deviation for defender agents at test time, separated by different false alert settings
Figure 8: Violin plots of returns after evaluating defender agents. The median is indicated as a dashed line, and the mean as a solid line.
Figure 9: Violin plots of returns after evaluating defender agents against an unseen attacker trained with RL, with false positives and negatives. The median is indicated as a dashed line, and the mean as a solid line.
Figure 10: Violin plots showing percentage of goals reached for attacker types averaged across all active defenders. The median is indicated as a dashed line, and the mean as a solid line.
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
RL
Value
Maximum Episode Length
300
Minimum Episode Length
120
Epochs per Batch
8
Number of Parallel Environments
16
Discount Factor
0.99
GAE λ
0.95
Appendix
Table 6: Hyperparameters used for training Vejde agents.
Parameter
Value
RL/PPO
Maximum episode length
1000
Minimum episode length
1000
Discount factor γ
0.99
No. training steps
1
Mini-batch size
100
Appendix
Table 7: Hyperparameters used for training the attacker agent Berglund, 2026 .
Figure 11: Attack steps types from CadsLang, illustrated as a graph with directed edges showing the relations between the attack step. Self-edges mean that the attack step can lead to the same attack step on a different asset.
Training reinforcement-learning agents for cyber defense requires an environment that reflects the operational setting: noisy, partial observations, several defenders coordinating across a network, and an adaptive adversary realized through self-play. We present NetForge RL, a multi-agent environment for this setting on procedurally generated enterprise and operational-technology (OT) networks. A red agent compromises hosts with partial observability; three zone-split blue agents defend from synthetic SIEM telemetry, Windows/Sysmon event logs encoded into dense embeddings rather than a ground-truth state vector. The environment follows the PettingZoo parallel API with fixed-shape observations and MITRE ATT&CK-mapped actions, ships five scenarios with named difficulty presets and a held-out evaluation split, and replays deterministically under a seed. A JAX backend vectorizes a reduced transition core, reaching 2.5 x 10^5 environment-steps/s at batch 4096 on CPU, as a fast surrogate for training-loop iteration. Alongside the environment we provide reference baselines (scripted, a JAX IPPO trainer, and a self-play tournament), six diagnostic probes that each measure one defensive skill, and an evaluation runner reporting 95% confidence intervals. We describe the reproducibility engineering behind the environment and include a responsible-use statement.
Cyber attack agents are typically trained and evaluated within a single simulator, making it unclear whether learned policies transfer beyond the environments in which they were developed. This limitation hinders both deployment and fair comparison, as cyber simulators differ substantially in their state representations, observation models, and action spaces. In this paper, we study policy transfer across cyber environments and argue that simulator-to-simulator and simulator-to-real transfer can be viewed as instances of the same underlying alignment problem. We propose a framework that separates state alignment from action translation, enabling a policy trained in one environment to operate in another without retraining. We evaluate transfer across four cyber platforms, CyberBattleSim, NetSecGame, CyberWheel, and NASim, including emulated deployments in NASim. Our experiments show that zero-shot transfer is feasible, fully preserving source-policy performance in closely aligned environments and achieving 45.2% win rates when transferring policies whose source performance is 60.5%. In emulated virtual machine environments, transferred policies exhibit a Jensen-Shannon divergence of 0.085 from native policies, indicating strong behavioral similarity. Code and benchmarks are available at: https://anonymous.4open.science/r/RL-Transfer-between-env-4F47/.
Sabrina Saika, Yinuo Du, Aritran Piplai
The University of Texas at El Paso, El Paso, TX, USA
We test the performance of agents for automated network intrusion response in a cyber range intended for human operator training. The range implements an emulated networking environment with a variable network topology, red-team emulation and simulated user agents. The goal of the defensive agents is to prevent hosts in the network from being accessed by the red-team agent, while minimizing the availability costs induced from defensive measures. Alerts are generated using a SIEM platform and mapped to a data modeling language used by the agents. We test a combination of heuristic agents and policies learned using reinforcement learning. The learned policies are optimized to minimize the combined cost using a cyber attack simulator modeling the network. We found that the reinforcement learning agents were overall more efficient at defending the system than the heuristic policy, and that the performance depends highly on the policy of the adversary in combination with the simulated users.
Jakob Nyberg, Teodor Sommestad, Andrei Buhaiu +3
Department of Network and Systems Engineering at KTH Royal Institute of Technology in Stockholm, Sweden · KTH