scientific article; zbMATH DE number 6987095
DOI10.23638/LMCS-14(4:15)2018zbMath1409.68182arXiv1702.02528MaRDI QIDQ4558787
Giorgio Bacci, Giovanni Bacci, Radu Mardare, Kim Guldstrand Larsen
Publication date: 30 November 2018
Full work available at URL: https://arxiv.org/abs/1702.02528
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On behavioural pseudometrics and closure ordinals
- Quantitative Kleene coalgebras
- Metrics for weighted transition systems: axiomatization and complexity
- Metrics for labelled Markov processes
- Axiomatizations for probabilistic finite-state behaviors
- A complete inference system for a class of regular behaviours
- On the metric-based approximate minimization of Markov chains
- Structural operational semantics for continuous state stochastic transition systems
- Approximating and computing behavioural distances in probabilistic transition systems
- On the quasivariety on convex subsets of affine spaces
- Postulates for the barycentric calculus
- Converging from Branching to Linear Metrics on Markov Chains
- On the Complexity of Computing Probabilistic Bisimilarity
- Structural Operational Semantics for Continuous State Probabilistic Processes
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- On the Total Variation Distance of Semi-Markov Chains
- Equational Axioms for Probabilistic Bisimilarity
- Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
- The logic of recursive equations
- Quantitative Algebraic Reasoning
- Semantics for Algebraic Operations
- Solving polynomial fixed point equations
- An Algebraic Theory of Markov Processes
- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules
- Two Complete Axiom Systems for the Algebra of Regular Events
- Fixpoint approach to the theory of computation
- Konvexe Räume
This page was built for publication:
