Pages that link to "Item:Q1014448"

The following pages link to Optimal state-space lumping in Markov chains (Q1014448):

Displaying 35 items.

• Lumping and reversed processes in cooperating automata (Q291348) (← links)
• Lumping evolutionary game dynamics on networks (Q309237) (← links)
• Individuals, populations and fluid approximations: a Petri net based perspective (Q313335) (← links)
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences (Q384933) (← links)
• Tackling continuous state-space explosion in a Markovian process algebra (Q387988) (← links)
• Combining decomposition and reduction for state space analysis of a self-stabilizing system (Q394332) (← links)
• Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
• Reasoning about proportional lumpability (Q832089) (← links)
• Lumpability for uncertain continuous-time Markov chains (Q832091) (← links)
• Tempus fugit: How to plug it (Q997994) (← links)
• Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
• Abstract model repair for probabilistic systems (Q1706149) (← links)
• Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis (Q1761681) (← links)
• On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
• From generic partition refinement to weighted tree automata minimization (Q1982644) (← links)
• Proportional lumpability and proportional bisimilarity (Q2139185) (← links)
• Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains (Q2302810) (← links)
• Comparative branching-time semantics for Markov chains (Q2387196) (← links)
• Equivalences for fluid stochastic Petri nets (Q2403677) (← links)
• Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
• Probabilistic model checking of complex biological pathways (Q2474435) (← links)
• Bisimulation relations for weighted automata (Q2481957) (← 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)
• A preorder relation for Markov reward processes (Q2643389) (← links)
• Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
• Semi-Product-Form Solution for PEPA Models with Functional Rates (Q2843075) (← links)
• Differential Bisimulation for a Markovian Process Algebra (Q2946344) (← links)
• Efficient CTMC Model Checking of Linear Real-Time Objectives (Q3000642) (← links)
• Minimality Notions via Factorization Systems and Examples (Q5043590) (← links)
• (Q5089272) (← links)
• Efficient Coalgebraic Partition Refinement (Q5111646) (← links)
• Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
• Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking (Q5415660) (← links)