Pages that link to "Item:Q3557064"

The following pages link to Simple O(m logn) Time Markov Chain Lumping (Q3557064):

Displaying 26 items.

• Lumping and reversed processes in cooperating automata (Q291348) (← links)
• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi (Q481103) (← links)
• Reasoning about proportional lumpability (Q832089) (← links)
• Lumpability for uncertain continuous-time Markov chains (Q832091) (← links)
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses (Q1753998) (← links)
• From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
• \textit{D\_PSNI}: delimited persistent stochastic non-interference (Q2049988) (← links)
• Out of control: reducing probabilistic models by control-state elimination (Q2152665) (← links)
• Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains (Q2302810) (← links)
• A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
• An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
• Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
• Efficient CTMC Model Checking of Linear Real-Time Objectives (Q3000642) (← links)
• Minimality Notions via Factorization Systems and Examples (Q5043590) (← links)
• Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence (Q5060192) (← links)
• (Q5089272) (← links)
• Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
• Persistent Stochastic Non-Interference (Q5158656) (← links)
• (Q5214815) (← links)
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism (Q5919051) (← links)
• Symbolic computation of differential equivalences (Q5920213) (← links)
• Explainability of probabilistic bisimilarity distances for labelled Markov chains (Q6091199) (← links)
• Automatically finding the right probabilities in Bayesian networks (Q6488813) (← links)
• Distributed coalgebraic partition refinement (Q6535613) (← links)
• Generic partition refinement and weighted tree automata (Q6535955) (← links)
• Explicit Hopcroft's trick in categorical partition refinement (Q6666777) (← links)