Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Uniformization with representatives: comprehensive transient analysis of infinite-state QBDs
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
CSL model checking algorithms for QBDs
Theoretical Computer Science
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Model checking infinite-state markov chains
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking of Infinite State Space Markov Chains by Stochastic Bounds
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Fundamenta Informaticae - Application of Concurrency to System Design
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Fundamenta Informaticae - Application of Concurrency to System Design
| Hi-index | 0.00 |
Jackson queueing networks (JQNs) are a very general class of queueing networks that find their application in a variety of settings. The state space of the continuous-time Markov chain (CTMC) that underlies such a JQN, is highly structured, however, of infinite size in as many dimensions as there are queues. We present CSL model checking algorithms for labeled JQNs. To do so, we rely on well-known product-form results for the steady-state probabilities in (stable) JQNs. The transient probabilities are computed using an uniformization-based approach. We develop a new notion of property independence that allows us to define model checking algorithms for labeled JQNs.