arXiv (OAI Expanded)
open access
Perturbation equivalence in labelled Markov chains
Behavioural equivalences, such as language equivalence and probabilistic bisimilarity, are fundamental techniques for reducing the size of probabilistic models. However, these equivalences are sensitive to the precise values of transition probabilities, making them unsuitable in applications where p
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Linear Algebra of Generalized Contextuality in All Prepare-Transform-Measure Scenarios#1012286
- Master's Dissertation: A Semantics of (Justified) Evidence-Based Belief and Multi-Agent Notions Thereof#92524
- Consistency of Optimal Matching-based Clustering for Mixtures of Markov Chains#1036373
- Making Theorem-Proving in Modal Logic Easy#756446
- MAS-ProVe: Understanding the Process Verification of Multi-Agent Systems#819295
Record · ID 1071193
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive