Robust Probabilistic Bisimilarity for Labelled Markov Chains
Fuente:
arXiv
Saved in:
| Main Authors: | Fatmi, Syyeda Zainab, Kiefer, Stefan, Parker, David, van Breugel, Franck |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Minimising the Probabilistic Bisimilarity Distance
by: Kiefer, Stefan, et al.
Published: (2024)
by: Kiefer, Stefan, et al.
Published: (2024)
Bisimilarity in fresh-register automata
by: Murawski, Andrzej S., et al.
Published: (2020)
by: Murawski, Andrzej S., et al.
Published: (2020)
Beyond Decisiveness of Infinite Markov Chains
by: Barbot, Benoît, et al.
Published: (2024)
by: Barbot, Benoît, et al.
Published: (2024)
Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
by: Zhang, Yuanrui, et al.
Published: (2023)
by: Zhang, Yuanrui, et al.
Published: (2023)
Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)
by: Zimmermann, Martin
Published: (2023)
Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
by: Heck, Linus, et al.
Published: (2025)
by: Heck, Linus, et al.
Published: (2025)
Comparing Labeled Markov Chains: A Cantor-Kantorovich Approach
by: Banse, Adrien, et al.
Published: (2025)
by: Banse, Adrien, et al.
Published: (2025)
Learning Verified Monitors for Hidden Markov Models
by: van der Maas, Luko, et al.
Published: (2025)
by: van der Maas, Luko, et al.
Published: (2025)
Learning Probabilistic Temporal Logic Specifications for Stochastic Systems
by: Roy, Rajarshi, et al.
Published: (2025)
by: Roy, Rajarshi, et al.
Published: (2025)
A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)
by: Różowski, Wojciech, et al.
Published: (2023)
Decision Questions for Probabilistic Automata on Small Alphabets
by: Bell, Paul C., et al.
Published: (2021)
by: Bell, Paul C., et al.
Published: (2021)
Model Checking Temporal Properties of Recursive Probabilistic Programs
by: Winkler, Tobias, et al.
Published: (2021)
by: Winkler, Tobias, et al.
Published: (2021)
SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logic
by: Quansah, Paapa Kwesi, et al.
Published: (2026)
by: Quansah, Paapa Kwesi, et al.
Published: (2026)
How Concise are Chains of co-Büchi Automata?
by: Ehlers, Rüdiger
Published: (2026)
by: Ehlers, Rüdiger
Published: (2026)
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)
by: Ye, Lina, et al.
Published: (2023)
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)
by: Daviaud, Laure, et al.
Published: (2023)
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
by: Jecker, Ismaël, et al.
Published: (2023)
by: Jecker, Ismaël, et al.
Published: (2023)
A Direct Translation from LTL with Past to Deterministic Rabin Automata
by: Azzopardi, Shaun, et al.
Published: (2024)
by: Azzopardi, Shaun, et al.
Published: (2024)
The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)
by: Barloy, Corentin, et al.
Published: (2025)
An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)
by: Rooduijn, Jan, et al.
Published: (2024)
A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)
by: Kuperberg, Denis
Published: (2022)
Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)
by: Haase, Christoph, et al.
Published: (2024)
String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)
by: Chocholatý, David, et al.
Published: (2026)
Towards a Coq-verified Chain of Esterel Semantics
by: Berry, Gérard, et al.
Published: (2019)
by: Berry, Gérard, et al.
Published: (2019)
About Time: Model-free Reinforcement Learning with Timed Reward Machines
by: Roy, Rajarshi, et al.
Published: (2025)
by: Roy, Rajarshi, et al.
Published: (2025)
The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)
by: Baeten, Jos C. M., et al.
Published: (2025)
Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)
by: Duret-Lutz, Alexandre, et al.
Published: (2025)
Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)
by: Almagor, Shaull, et al.
Published: (2025)
Unreliability in Practical Subclasses of Communicating Systems
by: Suresh, Amrita, et al.
Published: (2025)
by: Suresh, Amrita, et al.
Published: (2025)
Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
by: Di Giusto, Cinzia, et al.
Published: (2025)
by: Di Giusto, Cinzia, et al.
Published: (2025)
Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)
Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)
by: Li, Junle, et al.
Published: (2025)
DTMC Model Checking by Path Abstraction Revisited (extended version)
by: Hartmanns, Arnd, et al.
Published: (2025)
by: Hartmanns, Arnd, et al.
Published: (2025)
MightyPPL: Verification of MITL with Past and Pnueli Modalities
by: Ho, Hsi-Ming, et al.
Published: (2025)
by: Ho, Hsi-Ming, et al.
Published: (2025)
General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)
by: Balasubramanian, A. R., et al.
Published: (2025)
The termination of Nielsen transformations applied to word equations with length constraints
by: Przybocki, Benjamin, et al.
Published: (2025)
by: Przybocki, Benjamin, et al.
Published: (2025)
Similar Items
-
Minimising the Probabilistic Bisimilarity Distance
by: Kiefer, Stefan, et al.
Published: (2024) -
Bisimilarity in fresh-register automata
by: Murawski, Andrzej S., et al.
Published: (2020) -
Beyond Decisiveness of Infinite Markov Chains
by: Barbot, Benoît, et al.
Published: (2024) -
Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
by: Zhang, Yuanrui, et al.
Published: (2023) -
Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)