Pages that link to "Item:Q2996139"

The following pages link to Equational Axioms for Probabilistic Bisimilarity (Q2996139):

Displaying 16 items.

• A connection between concurrency and language theory (Q265802) (← links)
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
• Simulation relations for pattern matching in directed graphs (Q388784) (← links)
• Quantitative Kleene coalgebras (Q532394) (← links)
• Axiomatizations for probabilistic finite-state behaviors (Q875517) (← links)
• Equational theories for automata (Q2074221) (← links)
• Complete axiomatization for the total variation distance of Markov chains (Q2130580) (← links)
• Axiomatizing weighted synchronization trees and weighted bisimilarity (Q2447752) (← links)
• Labelled Markov Processes as Generalised Stochastic Relations (Q2864159) (← links)
• Probabilistic Barbed Congruence (Q2870293) (← links)
• Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview (Q2946322) (← links)
• Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
• (Q4558787) (← links)
• Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? (Q5056368) (← links)
• Equational properties of fixed-point operations in cartesian categories: An overview (Q5377703) (← links)