Cover Image

Structural Abstraction and Refinement for Probabilistic Programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Guanyan, Li, Juanen, Han, Zhilei, Wang, Peixin, Fu, Hongfei, He, Fei
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Counting Abstraction for the Verification of Structured Parameterized Networks
by: Bozga, Marius, et al.
Published: (2025)

Compositional Abstraction for Timed Systems with Broadcast Synchronization
by: Chen, Hanyue, et al.
Published: (2025)

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
by: Eichler, Paul, et al.
Published: (2024)

Refuting Equivalence in Probabilistic Programs with Conditioning
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Equivalence and Similarity Refutation for Probabilistic Programs
by: Chatterjee, Krishnendu, et al.
Published: (2024)

Weighted Automata for Exact Inference in Discrete Probabilistic Programs
by: Geißler, Dominik, et al.
Published: (2025)

On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)

Conservative Perception Models for Probabilistic Verification
by: Cleaveland, Matthew, et al.
Published: (2025)

Explicit Hopcroft's Trick in Categorical Partition Refinement
by: Sanada, Takahiro, et al.
Published: (2023)

A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
by: De Maria, Elisabetta, et al.
Published: (2026)

Probabilistic Programming Meets Automata Theory: Exact Inference using Weighted Automata
by: Geißler, Dominik, et al.
Published: (2025)

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

Iterating Non-Aggregative Structure Compositions
by: Bozga, Marius, et al.
Published: (2025)

Structural Reductions and Stutter Sensitive Properties
by: Paviot-Adet, Emmanuel, et al.
Published: (2022)

Do CFLOBDDs Actually Make Use of Linear Structure?
by: Sistla, Meghana Aparna, et al.
Published: (2026)

Data-Driven Abstractions for Control Systems via Random Exploration
by: Coppola, Rudi, et al.
Published: (2024)

Scalable Computation of Inter-Core Bounds Through Exact Abstractions
by: Foughali, Mohammed Aristide, et al.
Published: (2024)

The Similarity Control Problem with Required Events
by: Wang, Yu, 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)

Deciding Subtyping for Asynchronous Multiparty Sessions
by: Li, Elaine, et al.
Published: (2024)

Hyper-Minimization for Deterministic Register Automata
by: Li, Yong, et al.
Published: (2026)

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
by: Zhang, Kuize, et al.
Published: (2024)

Efficient Learning of Weak Deterministic Büchi Automata
by: Alluwayma, Mona, et al.
Published: (2025)

Saturation Problems for Families of Automata
by: Bohn, León, et al.
Published: (2025)

Model Checking Temporal Properties of Recursive Probabilistic Programs
by: Winkler, Tobias, et al.
Published: (2021)

Non-interference analysis of bounded labeled Petri nets
by: Ran, Ning, et al.
Published: (2025)

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

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

Automated Formalization of Probabilistic Requirements from Structured Natural Language
by: Mavridou, Anastasia, et al.
Published: (2025)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
by: Udupa, Sumukha, et al.
Published: (2024)

More on Maximally Permissive Similarity Control of Discrete Event Systems
by: Wang, Yu, et al.
Published: (2024)

Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification
by: Hong, Chih-Duo, et al.
Published: (2025)

LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
by: Chen, Lekai, et al.
Published: (2024)

Congruence-based Learning of Probabilistic Deterministic Finite Automata
by: Carrasco, Matías, et al.
Published: (2024)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
by: Yamakami, Tomoyuki
Published: (2021)

DTMC Model Checking by Path Abstraction Revisited (extended version)
by: Hartmanns, Arnd, et al.
Published: (2025)

Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
by: Heck, Linus, et al.
Published: (2025)

A Diamond Structure in the Transducer Hierarchy
by: Kaufmann, Noah
Published: (2021)

V-Star: Learning Visibly Pushdown Grammars from Program Inputs
by: Jia, Xiaodong, et al.
Published: (2024)

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