Skip to content
Preprint

LLM-based Framework for Generating and Verifying Parallel DEVS Statecharts

Aug 2026 · 0 citations · 29 references
Computer Science

TL;DR

An agentic PDEVS-LLM framework is introduced to assist human modelers in generating and verifying PDEVS statecharts for behavior modeling of atomic Parallel Discrete Event System Specification (PDEVS) models and shows a substantial improvement in the logical consistency of generated statecharts.

Abstract

The development of models demands sound modeling and simulation knowledge as well as domain knowledge. Every model should accurately represent a system's dynamics and be verifiable. Toward this objective, this research introduces an agentic PDEVS-LLM framework to assist human modelers in generating and verifying PDEVS statecharts for behavior modeling of atomic Parallel Discrete Event System Specification (PDEVS) models. The framework supports (re)generating plausible facts from a system description prompt using the agentic LLM used for generating plausible facts. Inconsistencies in plausible facts lead to incorrect PDEVS statecharts having logical structure and behavioral inaccuracies. A controlled-correction mechanism is developed to verify the logical consistency of the plausible facts. The agentic LLM is used to generate key behavioral conditions from the system description prompt. The plausible facts are then verified against the behavioral conditions using propositional logic entailment for a finite number of times. The verification results enable the generation of modification prompts that can reduce errors in generated plausible facts, resulting in more accurate PDEVS statecharts. To verify a statechart's logical correctness, its Timed Automata counterpart is manually created and verified for deadlock and reachability properties. The human modeler may regenerate plausible facts and PDEVS statecharts iteratively and incrementally. A basic correctness metric is introduced to quantify the completeness and accuracy of the expected behavioral traits of the PDEVS statechart models. A collection of example systems with varying levels of complexity is developed to demonstrate the capabilities and limitations of LLMs. The evaluation of the proposed verification mechanism shows a substantial improvement in the logical consistency of generated statecharts.

View source

Similar papers

#explainable ai Book Open access Oct 2026

Automated Modelica Model Repair Using Generative AI

This PhD contributes an agentic LLM-based framework for diagnosing and repairing Modelica models, together with the empirical foundations that make it feasible and reproducible.

Masoud Sadrnezhaad · 0 citations
Preprint Sep 2026

Formal Model Construction Guided by Model-Based Proof Sketches

Proof-Sketch-Guided Formal Model Synthesis (ProGS), an autoformalization method centered on model-based proof sketches, which improves over state-of-the-art agentic formal modeling approaches in syntactic validity, deductive verifiability, and behavioral correctness.

Hong-Shu Wang, Xin-Yue Zuo, Yu-Fan Cai et al. · 0 citations
Book Open access Oct 2026

Trustworthy generation of SysML v2 models for physical systems: a multi-agent approach

Model-Based Systems Engineering (MBSE) increasingly depends on architectural models of physical and engineered systems that are both syntactically valid and semantically consistent with their originating requirements. Authoring such models by hand in SysML v2 is slow and demands scarce expertise, a recognised “modellin...

Jose Olivert-Iserte · 0 citations
Preprint Aug 2026

Beyond Executable Models: The Pufibara Agent Harness and the Modelica Agent Workflow Benchmark for Physical System Modeling

Pufibara is presented, an agent harness that maintains persistent engineering state across revisions, associates execution and simulation evidence with the candidate that produced it, and makes submission an explicit agent action to evaluate end-to-end Modelica agent workflows.

Zi-Zhe Wang · 0 citations

Formal verification of run-to-completion style statecharts using Event-B

This work introduces a notion of refinement into a ‘run to completion’ statechart modelling notation, and uses Event-B’s tool support for theorem proving to leverage its tool support for theorem proving.

K. Morris, C. Snook, Son Hoang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.