Pages that link to "Item:Q2491633"

The following pages link to Branching bisimulation for probabilistic systems: characteristics and decidability (Q2491633):

Displaying 15 items.

• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
• Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
• Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
• Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
• Model independent approach to probabilistic models (Q831149) (← links)
• SOS specifications for uniformly continuous operators (Q1678172) (← links)
• Stuttering for abstract probabilistic automata (Q2436515) (← links)
• Remarks on Testing Probabilistic Processes (Q2864156) (← links)
• Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
• Stuttering for Abstract Probabilistic Automata (Q3455842) (← links)
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
• (Q4558784) (← links)
• (Q4580323) (← links)
• Branching Bisimulation Congruence for Probabilistic Systems (Q5415667) (← links)