Pages that link to "Item:Q2387196"

The following pages link to Comparative branching-time semantics for Markov chains (Q2387196):

Displaying 34 items.

• Lumping and reversed processes in cooperating automata (Q291348) (← 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)
• On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi (Q481103) (← links)
• Branching bisimulation congruence for probabilistic systems (Q764289) (← links)
• Assisting the design of a groupware system - Model checking usability aspects of thinkteam (Q1014561) (← links)
• Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
• Opacity for linear constraint Markov chains (Q1745942) (← links)
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses (Q1753998) (← links)
• Proportional lumpability and proportional bisimilarity (Q2139185) (← links)
• Trust evidence logic (Q2146059) (← links)
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities (Q2253178) (← links)
• Logical characterization of fluid equivalences (Q2323132) (← links)
• Non-bisimulation-based Markovian behavioral equivalences (Q2373649) (← links)
• Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
• A space-efficient simulation algorithm on probabilistic automata (Q2629854) (← links)
• Least upper bounds for probability measures and their applications to abstractions (Q2637319) (← links)
• Model checking for performability (Q2843861) (← links)
• On Abstraction of Probabilistic Systems (Q2937733) (← links)
• Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
• The How and Why of Interactive Markov Chains (Q3066128) (← links)
• Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
• Non-termination and secure information flow (Q3103612) (← links)
• (Q3384915) (← links)
• Deciding Simulations on Probabilistic Automata (Q3510797) (← links)
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems (Q3599065) (← links)
• (Q5089272) (← links)
• Persistent Stochastic Non-Interference (Q5158656) (← links)
• Probabilistic Bisimulation for Realistic Schedulers (Q5206954) (← links)
• Bisimulation and Simulation Relations for Markov Chains (Q5262953) (← links)
• Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity (Q5262954) (← links)
• A Semantics for Every GSPN (Q5300867) (← links)
• Compositional Design of Stochastic Timed Automata (Q5740181) (← links)
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism (Q5919051) (← links)