Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Despite considerable eort, the state-space explosion problem remains an issue in the analysis of Markov models. Given structure, symbolic representations can result in very compact encoding of the models. Hover, a major obstacle for symbolic methods is the need to store the probability vector(s) explicitly in main memory. ,  present a novel algorithm which relaxes these memory limitations by storing the probability vector on disk. The algorithm has been implemented using an MTBDD-based data structure to store the matrix and an array to store the vector.  report on experimental results for two benchmark models, a Kanban manufacturing system and a flexible manufacturing system, with models as large as 133 million states. Discrete-state Markovian models are widely employed for the analysis of communication networks and computer systems. It is often convenient to model such systems as Continuous Time Markov Chains (CTMCs), provided probability distributions are assumed to be exponential. A CTMC may be represented by a set of states and a transition rate matrix Q containing state transition rates as coecients. A CTMC can be analysed using probabilistic model checking. Required or desired performance properties are specified as formulas in the temporal logic CSL and then automatically verified using the appropriate model checking algorithms. A core component of these algorithms is the computation of the steady-state probabilities of the CTMC. This is reducible to the classical problem of solving a system of linear equations of the form Ax = b where b = 0. A range of solution techniques exist to combat the
['Marta Z. Kwiatkowska', 'Rashid Mehmood', 'Gethin Norman', 'David Parker']
I am writing a research paper on a idea A Symbolic Out-of-Core Solution Method for Markov Models ?
[{"from": "human", "value": "I am writing a research paper on a idea A Symbolic Out-of-Core Solution Method for Markov Models ?"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Despite considerable eort, the state-space explosion problem remains an issue in the analysis of Markov models. Given structure, symbolic representations can result in very compact encoding of the models. Hover, a major obstacle for symbolic methods is the need to store the probability vector(s) explicitly in main memory. ,  present a novel algorithm which relaxes these memory limitations by storing the probability vector on disk. The algorithm has been implemented using an MTBDD-based data structure to store the matrix and an array to store the vector.  report on experimental results for two benchmark models, a Kanban manufacturing system and a flexible manufacturing system, with models as large as 133 million states. Discrete-state Markovian models are widely employed for the analysis of communication networks and computer systems. It is often convenient to model such systems as Continuous Time Markov Chains (CTMCs), provided probability distributions are assumed to be exponential. A CTMC may be represented by a set of states and a transition rate matrix Q containing state transition rates as coecients. A CTMC can be analysed using probabilistic model checking. Required or desired performance properties are specified as formulas in the temporal logic CSL and then automatically verified using the appropriate model checking algorithms. A core component of these algorithms is the computation of the steady-state probabilities of the CTMC. This is reducible to the classical problem of solving a system of linear equations of the form Ax = b where b = 0. A range of solution techniques exist to combat the"}]