Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements

Autor:	Tati, Bharath Siva Kumar, Siegle, Markus
Rok vydání:	2016
Předmět:	Computer Science - Systems and Control Computer Science - Logic in Computer Science Computer Science - Performance D.2.4 G.3 C.4
Zdroj:	EPTCS 220, 2016, pp. 77-89
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.220.7
Popis:	This paper presents algorithms for identifying and reducing a dedicated set of controllable transition rates of a state-labelled continuous-time Markov chain model. The purpose of the reduction is to make states to satisfy a given requirement, specified as a CSL upper time-bounded Until formula. We distinguish two different cases, depending on the type of probability bound. A natural partitioning of the state space allows us to develop possible solutions, leading to simple algorithms for both cases. Comment: In Proceedings Cassting'16/SynCoP'16, arXiv:1608.00177
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1608.00658 Zobrazit plný text záznamu View this record from Arxiv