Search arXivSearch

arXiv · 2509.01130

Formal Verification of Isothermal Chemical Reactors

Abstract

Chemical reactors are dynamic systems that can be described by systems of ordinary differential equations (ODEs). Reactor safety, regulatory compliance, and economics depend on whether certain states are reachable by the reactor, and are generally assessed using numerical simulation. In this work, we show how differential dynamic logic (dL), as implemented in the automated theorem prover KeYmaera X, can be used to symbolically determine reachability in isothermal chemical reactors, providing mathematical guarantees that certain conditions are satisfied (for example, that an outlet concentration never exceeds a regulatory threshold). First, we apply dL to systems whose dynamics can be solved in closed form, such as first-order reactions in batch reactors, proving that such reactors cannot exceed specified concentration limits. We extend this method to reaction models as complex as Michaelis-Menten kinetics, whose dynamics require approximations or numerical solutions. In all cases, proofs are facilitated by identification of invariants; we find that conservation of mass is both a principle proved from the ODEs describing mass action kinetics as well as a useful relationship for proving other properties. Useful invariants for continuous stirred tank reactors (CSTRs) were not found, which limited the complexity of reaction networks that could be proved with dL. While dL provides an interesting symbolic logic approach for reachability in chemical reactions, the bounds we obtained are quite broad relative to those typically achieved via numerical reachability analyses.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Parivash Feyzishendi, Sophia Hamer, Jinyu Huang, Tyler R. Josephson. 2025-09-01. Formal Verification of Isothermal Chemical Reactors. https://arxiv.org/abs/2509.01130

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deciding Predicate Logical Theories of Real-Valued Functions

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible.

cs.LO

Structural Liveness of Conservative Petri Nets

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the values of the minimal live markings are at most doubly exponential in the size of the net. This implies the EXPSPACE-completeness of structural liveness for conservative Petri nets. The result also applies to structurally bounded Petri nets, whereas the complexity of the general case remains open. As a proof ingredient of independent interest, we present an extension of known results on the bounds of minimal integer solutions to Boolean combinations of linear equalities, inequalities, and divisibility constraints.

cs.LO

Verifying Numerical Methods with Isabelle/HOL

Modern machine learning pipelines and ODE solvers are built on numerical algorithms. Reliable numerical methods are thus a prerequisite for trustworthy machine learning and cyber-physical systems. We evaluate a framework designed for verifying imperative programs and the Isabelle proof assistant as tools for proving the total correctness of four numerical algorithms: the bisection method, the fixed-point method, the perceptron, and the gradient descent algorithm. Our verifications required subtle extensions and generalisations to Isabelle's version of Taylor's theorem and higher-order derivatives. Finally, we reflect on the framework's automation, friendly syntax, and on further requirements to turn it into a verification tool for numerical methods.

cs.LO