Pages that link to "Item:Q1975973"

The following pages link to Deciding bisimilarity and similarity for probabilistic processes. (Q1975973):

Displaying 45 items.

• Weak bisimulations for fuzzy automata (Q279375) (← links)
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
• Three-valued abstraction for probabilistic systems (Q444484) (← links)
• Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
• Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
• Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
• Deciding bisimilarity is P-complete (Q1203120) (← links)
• Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
• Exploring probabilistic bisimulations. I (Q1941884) (← links)
• From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (Q2102926) (← links)
• On well-founded and recursive coalgebras (Q2200809) (← links)
• Discrete time stochastic and deterministic Petri box calculus dtsdPBC (Q2212703) (← links)
• Verifying quantum communication protocols with ground bisimulation (Q2233434) (← links)
• Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
• Comparative branching-time semantics for Markov chains (Q2387196) (← links)
• Bisimulation relations for weighted automata (Q2481957) (← links)
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
• A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
• An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
• Stochastic equivalence for performance analysis of concurrent systems in dtsiPBC (Q2633503) (← links)
• Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
• An Algorithm for Probabilistic Alternating Simulation (Q2891387) (← links)
• A General Framework for Probabilistic Characterizing Formulae (Q2891432) (← links)
• Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
• Differential Bisimulation for a Markovian Process Algebra (Q2946344) (← links)
• Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation (Q3012928) (← links)
• The How and Why of Interactive Markov Chains (Q3066128) (← links)
• Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
• Weighted Bisimulation in Linear Algebraic Form (Q3184672) (← links)
• Deciding Simulations on Probabilistic Automata (Q3510797) (← links)
• A Space-Efficient Probabilistic Simulation Algorithm (Q3541022) (← links)
• (Q4558784) (← links)
• Converging from branching to linear metrics on Markov chains (Q4559599) (← links)
• (Q5009413) (← links)
• (Q5028446) (← links)
• Model Checking Linear-Time Properties of Probabilistic Systems (Q5072555) (← links)
• Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
• (Q5214815) (← links)
• Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
• Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract) (Q5739351) (← links)
• Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application (Q5863634) (← links)
• Symbolic computation of differential equivalences (Q5920213) (← links)
• Deciding probabilistic bisimilarity distance one for labelled Markov chains (Q6041138) (← links)
• Generic partition refinement and weighted tree automata (Q6535955) (← links)