Cover Image

CTMCs with Imprecisely Timed Observations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Badings, Thom, Volk, Matthias, Junges, Sebastian, Stoelinga, Marielle, Jansen, Nils
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Probabilistic Alternating Simulations for Policy Synthesis in Uncertain Stochastic Dynamical Systems
by: Badings, Thom, et al.
Published: (2025)

Robust Almost-Sure Reachability in Multi-Environment MDPs
by: van der Vegt, Marck, et al.
Published: (2023)

Querying Attack-Fault-Defense Trees: Property Specification in Smart Grid and Aerospace Case Studies
by: Soltani, Reza, et al.
Published: (2025)

Probabilistic Model Checking Taken by Storm
by: Volk, Matthias, et al.
Published: (2026)

BayesL: a Logical Framework for the Verification of Bayesian Networks
by: Nicoletti, Stefano M., et al.
Published: (2025)

Best-Effort Policies for Robust Markov Decision Processes
by: Abate, Alessandro, et al.
Published: (2025)

Querying Fault and Attack Trees: Property Specification on a Water Network
by: Nicoletti, Stefano M., et al.
Published: (2024)

PFL: a Probabilistic Logic for Fault Trees
by: Nicoletti, Stefano M., et al.
Published: (2023)

ATM: a Logic for Quantitative Security Properties on Attack Trees
by: Nicoletti, Stefano M., et al.
Published: (2023)

WATCHDOG: an ontology-aWare risk AssessmenT approaCH via object-oriented DisruptiOn Graphs
by: Nicoletti, Stefano M., et al.
Published: (2024)

How hard can it be? Quantifying MITRE attack campaigns with attack trees and cATM logic
by: Nicoletti, Stefano M., et al.
Published: (2024)

Small Test Suites for Active Automata Learning
by: Kruger, Loes, et al.
Published: (2024)

Relating Apartness and Branching Bisimulation Games
by: Rot, Jurriaan, et al.
Published: (2024)

Robust Shielding for Safe Reinforcement Learning
by: Court, Edwin Hamel-De le, et al.
Published: (2026)

A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs
by: Suilen, Marnix, et al.
Published: (2024)

Policies Grow on Trees: Model Checking Families of MDPs
by: Andriushchenko, Roman, et al.
Published: (2024)

A Unifying Approach to Product Constructions for Quantitative Temporal Inference
by: Watanabe, Kazuki, et al.
Published: (2024)

Small Decision Trees for MDPs with Deductive Synthesis
by: Andriushchenko, Roman, et al.
Published: (2025)

Formal Modelling and Analysis of Slot Machines
by: Groote, Jan Friso, et al.
Published: (2024)

A formal specification of the desired software behaviour of the Princess Marijke lock complex
by: Groote, Jan Friso, et al.
Published: (2025)

State Matching and Multiple References in Adaptive Active Automata Learning
by: Kruger, Loes, et al.
Published: (2024)

Error-awareness Accelerates Active Automata Learning
by: Kruger, Loes, et al.
Published: (2026)

Compositional Value Iteration with Pareto Caching
by: Watanabe, Kazuki, et al.
Published: (2024)

Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)

Compositional Verification of Almost-Sure Büchi Objectives in MDPs
by: van der Vegt, Marck, et al.
Published: (2025)

Learning Robust Markov Models for Safe Runtime Monitoring
by: Skurka, Antonina, et al.
Published: (2026)

Tractable Hyperproperties for MDPs
by: Gerlach, Lina, et al.
Published: (2026)

Proceedings Sixth Workshop on Models for Formal Analysis of Real Systems
by: Lang, Frédéric, et al.
Published: (2024)

Imprecise Probabilities Meet Partial Observability: Game Semantics for Robust POMDPs
by: Bovy, Eline M., et al.
Published: (2024)

Tools at the Frontiers of Quantitative Verification
by: Andriushchenko, Roman, et al.
Published: (2024)

Policy Verification in Stochastic Dynamical Systems Using Logarithmic Neural Certificates
by: Badings, Thom, et al.
Published: (2024)

Graded String Diagrams for Imprecise Probability and Causal Intervention
by: Sarkis, Ralph, et al.
Published: (2025)

Pareto Curves for Compositionally Model Checking String Diagrams of MDPs
by: Watanabe, Kazuki, et al.
Published: (2024)

Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
by: Češka, Milan, et al.
Published: (2026)

Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking
by: Heck, Linus, et al.
Published: (2025)

Learning Verified Monitors for Hidden Markov Models
by: van der Maas, Luko, et al.
Published: (2025)

Normalisation for Negative Free Logics without and with Definite Descriptions
by: Kürbis, Nils
Published: (2024)

A Domain-Theoretic Foundation for Imprecise Probability and Credal Sets
by: Edalat, Abbas, et al.
Published: (2026)

Shields to Guarantee Probabilistic Safety in MDPs
by: Heck, Linus, et al.
Published: (2026)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)