scientific article; zbMATH DE number 6987095
DOI10.23638/LMCS-14(4:15)2018zbMATH Open1409.68182arXiv1702.02528MaRDI QIDQ4558787FDOQ4558787
Authors: Giorgio Bacci, Giovanni Bacci, Radu Mardare, Kim G. Larsen 
Publication date: 30 November 2018
Full work available at URL: https://arxiv.org/abs/1702.02528
Title of this publication is not available (Why is that?)
Recommendations
- Complete axiomatization for the bisimilarity distance on Markov chains
- Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
- Deciding probabilistic bisimilarity distance one for labelled Markov chains
- Approximating bisimilarity for Markov processes
- Bisimilarity of distributionally equivalent Markov transition systems
- scientific article; zbMATH DE number 7559464
- Computing probabilistic bisimilarity distances for probabilistic automata
- Computing probabilistic bisimilarity distances for probabilistic automata
- Bisimulation and Simulation Relations for Markov Chains
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Approximating and computing behavioural distances in probabilistic transition systems
- Sound and complete axiomatizations of coalgebraic language equivalence
- Equational axioms for probabilistic bisimilarity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metrics for labelled Markov processes
- Two Complete Axiom Systems for the Algebra of Regular Events
- Title not available (Why is that?)
- Title not available (Why is that?)
- A complete inference system for a class of regular behaviours
- Title not available (Why is that?)
- Structural operational semantics for continuous state stochastic transition systems
- Axioms for probability and nondeterminism
- Structural operational semantics for continuous state probabilistic processes
- Title not available (Why is that?)
- Axiomatizations for probabilistic finite-state behaviors
- On the complexity of computing probabilistic bisimilarity
- Metrics for weighted transition systems: axiomatization and complexity
- On the quasivariety on convex subsets of affine spaces
- An algebraic theory of Markov processes
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- On behavioural pseudometrics and closure ordinals
- Fixpoint approach to the theory of computation
- Quantitative Kleene coalgebras
- Konvexe Räume
- Semantics for algebraic operations
- Title not available (Why is that?)
- Postulates for the barycentric calculus
- Title not available (Why is that?)
- Axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules
- The logic of recursive equations
- Solving polynomial fixed point equations
- Title not available (Why is that?)
- Converging from Branching to Linear Metrics on Markov Chains
- On the total variation distance of semi-Markov chains
- On the metric-based approximate minimization of Markov chains
- Quantitative Algebraic Reasoning
- Complete axiomatization for the bisimilarity distance on Markov chains
Cited In (6)
- Complete axiomatization for the bisimilarity distance on Markov chains
- Explainability of probabilistic bisimilarity distances for labelled Markov chains
- Deciding probabilistic bisimilarity distance one for labelled Markov chains
- Beyond nonexpansive operations in quantitative algebraic reasoning
- Learning model checking and the kernel trick for signal temporal logic on stochastic processes
- Monads and Quantitative Equational Theories for Nondeterminism and Probability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558787)
