Interactive Markov chains. And the quest for quantified quality
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(79)- nano\(\kappa\): A calculus for the modeling and simulation of nano devices
- Towards general axiomatizations for bisimilarity and trace semantics
- Reflections on the future of concurrency theory in general and process calculi in particular
- Model-based testing of probabilistic systems
- A theory of stochastic systems. II: Process algebra
- Efficient approximation of optimal control for continuous-time Markov games
- Stochastic model checking of the stochastic quality calculus
- Reasoning about proportional lumpability
- The how and why of interactive Markov chains
- Compositional design of stochastic timed automata
- Reduction semantics in Markovian process algebra
- Lumpability abstractions of rule-based systems
- Lifting non-finite axiomatizability results to extensions of process algebras
- On the semantics of Markov automata
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
- Constraint Markov chains
- Equivalence of switching linear systems by bisimulation
- Measurable stochastics for Brane calculus
- A semantics for every GSPN
- Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
- Compositional abstraction for stochastic systems
- Polynomial time decision algorithms for probabilistic automata
- Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
- Lumping and reversed processes in cooperating automata
- Performance preserving equivalence for stochastic process algebra dtsdPBC
- An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA
- On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
- Equivalence checking 40 years after: a review of bisimulation tools
- Mixing logics and rewards for the component-oriented specification of performance measures
- Approximate mean value analysis based on Markov chain aggregation by composition
- Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis
- A Tutorial on Interactive Markov Chains
- Nondeterministic probabilistic Petri net -- a new method to study qualitative and quantitative behaviors of system
- Static analysis of IMC
- Performance model checking scenario-aware dataflow
- Probabilistic mobile ambients
- Distributed synthesis in continuous time
- Probabilistic contracts for component-based design
- Non-bisimulation-based Markovian behavioral equivalences
- Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools
- On the relations between Markov chain lumpability and reversibility
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors
- Axiomatizing maximal progress and discrete time
- A theory of stochastic systems. I: Stochastic automata
- YMCA: why Markov chain algebra?
- Quantitative Analysis of Concurrent Reversible Computations
- Partition refinement of component interaction automata
- Compositional probabilistic verification through multi-objective model checking
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- On process rate semantics
- Bisimulation and Simulation Relations for Markov Chains
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Probabilistic bisimulation for realistic schedulers
- Model Based Importance Analysis for Minimal Cut Sets
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- Model checking for probabilistic timed automata
- A design methodology for verified web-service mediators
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects
- Reconciling real and stochastic time: the need for probabilistic refinement
- Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains
- A Hemimetric Extension of Simulation for Semi-Markov Decision Processes
- Proportional lumpability and proportional bisimilarity
- scientific article; zbMATH DE number 1397300 (Why is no real title available?)
- Cost vs. time in stochastic games and Markov automata
- Fault trees on a diet: automated reduction by graph rewriting
- Comparative branching-time semantics for Markov chains
- Probabilistic bisimulation for realistic schedulers
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- From Gene Regulation to Stochastic Fusion
- A general SOS theory for the specification of probabilistic transition systems
- Revisiting interactive Markov chains
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
- A modest Markov automata tutorial
- scientific article; zbMATH DE number 1786475 (Why is no real title available?)
- On the Minimisation of Acyclic Models
This page was built for publication: Interactive Markov chains. And the quest for quantified quality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701689)
