Pages that link to "Item:Q701689"
From MaRDI portal
The following pages link to Interactive Markov chains. And the quest for quantified quality (Q701689):
Displaying 50 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions (Q288785) (← links)
- 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)
- Compositional probabilistic verification through multi-objective model checking (Q386007) (← links)
- Measurable stochastics for Brane calculus (Q418841) (← links)
- Lumpability abstractions of rule-based systems (Q418843) (← links)
- Static analysis of IMC (Q444504) (← links)
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi (Q481103) (← links)
- A design methodology for verified web-service mediators (Q488326) (← links)
- Polynomial time decision algorithms for probabilistic automata (Q498403) (← links)
- Constraint Markov chains (Q554215) (← links)
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
- Model-based testing of probabilistic systems (Q682363) (← links)
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games (Q766176) (← links)
- Reasoning about proportional lumpability (Q832089) (← links)
- nano\(\kappa\): A calculus for the modeling and simulation of nano devices (Q959782) (← links)
- Lifting non-finite axiomatizability results to extensions of process algebras (Q969643) (← links)
- Mixing logics and rewards for the component-oriented specification of performance measures (Q995461) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- On the use of MTBDDs for performability analysis and verification of stochastic systems. (Q1400289) (← links)
- Approximate mean value analysis based on Markov chain aggregation by composition (Q1434435) (← links)
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors (Q1651010) (← links)
- Probabilistic bisimulation for realistic schedulers (Q1671244) (← links)
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses (Q1753998) (← links)
- Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis (Q1761681) (← links)
- Reconciling real and stochastic time: the need for probabilistic refinement (Q1941867) (← links)
- Partition refinement of component interaction automata (Q1951613) (← links)
- Proportional lumpability and proportional bisimilarity (Q2139185) (← links)
- Towards general axiomatizations for bisimilarity and trace semantics (Q2237336) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools (Q2352775) (← links)
- Non-bisimulation-based Markovian behavioral equivalences (Q2373649) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Cost vs. time in stochastic games and Markov automata (Q2403526) (← links)
- Fault trees on a diet: automated reduction by graph rewriting (Q2403528) (← links)
- On the relations between Markov chain lumpability and reversibility (Q2406431) (← links)
- Reduction semantics in Markovian process algebra (Q2413025) (← links)
- Probabilistic contracts for component-based design (Q2441722) (← links)
- On process rate semantics (Q2474433) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
- A theory of stochastic systems. I: Stochastic automata (Q2575854) (← links)
- A theory of stochastic systems. II: Process algebra (Q2575855) (← links)
- A general SOS theory for the specification of probabilistic transition systems (Q2629851) (← links)
- Nondeterministic probabilistic Petri net -- a new method to study qualitative and quantitative behaviors of system (Q2637309) (← links)
- Distributed Synthesis in Continuous Time (Q2811352) (← links)
- Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular (Q2870196) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
