Fluid computation of passage-time distributions in large Markov models
DOI10.1016/J.TCS.2011.07.017zbMATH Open1234.68318OpenAlexW2152224120MaRDI QIDQ764294FDOQ764294
Authors: Richard A. Hayden, Anton Stefanek, Jeremy T. Bradley 
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.017
Recommendations
fluid approximationscalability analysisstochastic process algebrapassage-time distributionservice level agreement
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Linear Matrix Inequalities in System and Control Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized inverses. Theory and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation of piecewise quadratic Lyapunov functions for hybrid systems
- Title not available (Why is that?)
- Solutions of ordinary differential equations as limits of pure jump markov processes
- A fluid analysis framework for a Markovian process algebra
- Differential equation approximations for Markov chains
- A Stochastic Epidemiological Model and a Deterministic Limit for BitTorrent-Like Peer-to-Peer File-Sharing Networks
- Title not available (Why is that?)
- Basics of Applied Stochastic Processes
- Title not available (Why is that?)
- A Proof for the Queuing Formula: L = λW
- Title not available (Why is that?)
- Introduction to Dynamical Systems
- Analysing distributed internet worm attacks using continuous state-space approximation of process algebra models
- Title not available (Why is that?)
- Uniformization and hypergraph partitioning for the distributed computation of response time densities in very large Markov models
- Recursive algorithms, urn processes and chaining number of chain recurrent sets
- Relating continuous and discrete PEPA models of signalling pathways
- Stochastic concurrent constraint programming and differential equations
- Performance evaluation of computer and communication systems.
Cited In (15)
- Hybrid behaviour of Markov population models
- Nonlinear Markov processes in big networks
- Mean-field analysis of hybrid Markov population models with time-inhomogeneous rates
- Probabilistic Model Checking for Continuous-Time Markov Chains via Sequential Bayesian Inference
- Model checking Markov population models by stochastic approximations
- Passage times in fluid models with application to risk processes
- Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation
- Analysis of Markov jump processes under terminal constraints
- Applying Mean-Field Approximation to Continuous Time Markov Chains
- A unified framework for differential aggregations in Markovian process algebra
- Hypergraph-based parallel computation of passage time densities in large semi-Markov models
- Model checking single agent behaviours by fluid approximation
- Fast simulation of Markov fluid models
- Geometric fluid approximation for general continuous-time Markov chains
- Tackling continuous state-space explosion in a Markovian process algebra
Uses Software
This page was built for publication: Fluid computation of passage-time distributions in large Markov models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764294)
