Cover Image

Learning Probabilistic Temporal Logic Specifications for Stochastic Systems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Roy, Rajarshi, Pote, Yash, Parker, David, Kwiatkowska, Marta
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Artificial Intelligence Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

About Time: Model-free Reinforcement Learning with Timed Reward Machines
by: Roy, Rajarshi, et al.
Published: (2025)

What is Formal Verification without Specifications? A Survey on mining LTL Specifications
by: Neider, Daniel, et al.
Published: (2025)

Temporal Ensemble Logic
by: Zhang, Guo-Qiang
Published: (2024)

Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)

SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logic
by: Quansah, Paapa Kwesi, et al.
Published: (2026)

Safety Verification of Stochastic Systems under Signal Temporal Logic Specifications
by: Ma, Liqian, et al.
Published: (2025)

Mining Beyond the Bools: Learning Data Transformations and Temporal Specifications
by: Kouteili, Sam Nicholas, et al.
Published: (2026)

The Transformation Logics
by: Ronca, Alessandro
Published: (2023)

Robust Probabilistic Bisimilarity for Labelled Markov Chains
by: Fatmi, Syyeda Zainab, et al.
Published: (2025)

Positional Properties in Temporal Logic
by: Newman, Jessica, et al.
Published: (2026)

Systemic Constraints of Undecidability
by: Bulin, Seth
Published: (2025)

Planning with Linear Temporal Logic Specifications: Handling Quantifiable and Unquantifiable Uncertainty
by: Yu, Pian, et al.
Published: (2025)

Preference-Based Planning in Stochastic Environments: From Partially-Ordered Temporal Goals to Most Preferred Policies
by: Rahmani, Hazhar, et al.
Published: (2024)

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

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
by: Besset, Antoine, et al.
Published: (2025)

Online Monitoring of Metric Temporal Logic using Sequential Networks
by: Ulus, Dogan
Published: (2019)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)

FORM: Learning Expressive and Transferable First-Order Logic Reward Machines
by: Ardon, Leo, et al.
Published: (2024)

LTL$_f$ Learning Meets Boolean Set Cover
by: Bathie, Gabriel, et al.
Published: (2025)

Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning
by: Chakraborty, Debraj, et al.
Published: (2026)

$O_2$ is a multiple context-free grammar: an implementation-, formalisation-friendly proof
by: Caminati, Marco B.
Published: (2024)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Enforcing Temporal Constraints for LLM Agents
by: Kamath, Adharsh, et al.
Published: (2025)

Minimising the Probabilistic Bisimilarity Distance
by: Kiefer, Stefan, et al.
Published: (2024)

Logics for Context-free Hyperproperties
by: Winter, Sarah, et al.
Published: (2026)

Subtyping in DHOL -- Extended preprint
by: Rothgang, Colin, et al.
Published: (2025)

Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
by: Hausmann, Daniel, et al.
Published: (2025)

LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
by: Aminof, Benjamin, et al.
Published: (2024)

Non-Deterministic Planning for Hyperproperty Verification
by: Beutner, Raven, et al.
Published: (2024)

SemML 2.0: Synthesizing Controllers for LTL
by: Křetínský, Jan, et al.
Published: (2026)

A Formal Framework for the Explanation of Finite Automata Decisions
by: Granada, Jaime Cuartas, et al.
Published: (2026)

A process algebraic framework for multi-agent dynamic epistemic systems
by: Aldini, Alessandro
Published: (2024)

Verification of Neural Networks (Lecture Notes)
by: Bollig, Benedikt
Published: (2026)

Symbolic Synthesis for LTLf+ Obligations
by: De Giacomo, Giuseppe, et al.
Published: (2026)

A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)

Decision Questions for Probabilistic Automata on Small Alphabets
by: Bell, Paul C., et al.
Published: (2021)

Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)