Interactive Markov chains. And the quest for quantified quality
From MaRDI portal
Publication:701689
DOI10.1007/3-540-45804-2zbMath1012.68142OpenAlexW1597655219MaRDI QIDQ701689
Publication date: 7 November 2002
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45804-2
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Related Items
Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey, Reasoning about proportional lumpability, Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions, Lumping and reversed processes in cooperating automata, Non-bisimulation-based Markovian behavioral equivalences, Performance Model Checking Scenario-Aware Dataflow, A general SOS theory for the specification of probabilistic transition systems, Proportional lumpability and proportional bisimilarity, A Semantics for Every GSPN, Nondeterministic probabilistic Petri net -- a new method to study qualitative and quantitative behaviors of system, Comparative branching-time semantics for Markov chains, A compositional model to reason about end-to-end QoS in stochastic Reo connectors, Cost vs. time in stochastic games and Markov automata, Fault trees on a diet: automated reduction by graph rewriting, Probabilistic bisimulation for realistic schedulers, On the relations between Markov chain lumpability and reversibility, A Tutorial on Interactive Markov Chains, Computing Behavioral Relations for Probabilistic Concurrent Systems, A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences, Compositional probabilistic verification through multi-objective model checking, Unnamed Item, Reduction semantics in Markovian process algebra, Quantitative Analysis of Concurrent Reversible Computations, A Hemimetric Extension of Simulation for Semi-Markov Decision Processes, On the use of MTBDDs for performability analysis and verification of stochastic systems., Reconciling real and stochastic time: the need for probabilistic refinement, Measurable stochastics for Brane calculus, Lumpability abstractions of rule-based systems, A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains, Equivalence checking 40 years after: a review of bisimulation tools, Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects, Partition refinement of component interaction automata, Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains, Static analysis of IMC, Probabilistic contracts for component-based design, Model Based Importance Analysis for Minimal Cut Sets, On the Minimisation of Acyclic Models, Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains, From Gene Regulation to Stochastic Fusion, Approximate mean value analysis based on Markov chain aggregation by composition, On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi, A design methodology for verified web-service mediators, CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes, Polynomial time decision algorithms for probabilistic automata, Towards general axiomatizations for bisimilarity and trace semantics, On the Semantics of Markov Automata, Model-based testing of probabilistic systems, Model checking for probabilistic timed automata, On process rate semantics, Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses, nano\(\kappa\): A calculus for the modeling and simulation of nano devices, Stochastic Petri net models of \(\text{Ca}^{2+}\) signaling complexes and their analysis, Compositional Design of Stochastic Timed Automata, Lifting non-finite axiomatizability results to extensions of process algebras, Constraint Markov chains, An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA, Equivalence of switching linear systems by bisimulation, Mixing logics and rewards for the component-oriented specification of performance measures, The How and Why of Interactive Markov Chains, Probabilistic Bisimulation for Realistic Schedulers, Probabilistic mobile ambients, Distributed Synthesis in Continuous Time, The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism, Compositional Abstraction for Stochastic Systems, Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games, Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes, A theory of stochastic systems. I: Stochastic automata, A theory of stochastic systems. II: Process algebra, Bisimulation and Simulation Relations for Markov Chains, YMCA, Reflections on the Future of Concurrency Theory in General and Process Calculi in Particular, Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools, Efficient approximation of optimal control for continuous-time Markov games
Uses Software
