Pith. sign in

REVIEW 1 cited by

Data-Driven Abstraction and Synthesis for Stochastic Systems with Unknown Dynamics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2508.15543 v2 pith:EYGQWK2T submitted 2025-08-21 eess.SY cs.SY

Data-Driven Abstraction and Synthesis for Stochastic Systems with Unknown Dynamics

classification eess.SY cs.SY
keywords dynamicsstochasticsynthesissystemsunknownabstractionabstractionsapproach
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We study the automated abstraction-based synthesis of correct-by-construction control policies for stochastic dynamical systems with unknown dynamics. Our approach is to learn an abstraction from sampled data, which is represented in the form of a finite Markov decision process (MDP). In this paper, we present a data-driven technique for constructing finite-state interval MDP (IMDP) abstractions of stochastic systems with unknown nonlinear dynamics. As a distinguishing and novel feature, our technique only requires (1) noisy state-input-state observations and (2) an upper bound on the system's Lipschitz constant. Combined with standard model-checking techniques, our IMDP abstractions enable the synthesis of policies that satisfy probabilistic temporal properties (such as "reach-while-avoid") with a predefined confidence. Our experimental results show the effectiveness and robustness of our approach.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the Optimality of Uncertain MDP Abstractions

    eess.SY 2026-04 unverdicted novelty 7.0

    Set-valued MDP abstractions satisfy the vanishing ambiguity condition for asymptotic optimality and algorithm completeness, while interval MDP abstractions do not.