Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the Fourth Annual Symposium on Logic in computer science
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
IEEE Transactions on Software Engineering
Symbolic Model Checking for Probabilistic Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Product form Markov chains are a class of compositional Markovian models that can be proved to benefit from a decomposed solution of the steady-state distribution (i.e. the steady-state distribution is given by the product of the components' steady-state distributions). In this paper we focus on the Boucherie product processes, a specific class of product form Continuous Time Markov Chains. We show that the compositional constraints that lead to the product form result in that class, can be exploited in the model checking problem as well, leading to a decomposed semantics for a fragment of the Continuous Stochastic Logic.