Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2016-07-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1608.00658v1 |
| _version_ | 1818540252628779008 |
|---|---|
| author | Bharath Siva Kumar Tati Markus Siegle |
| author_facet | Bharath Siva Kumar Tati Markus Siegle |
| author_sort | Bharath Siva Kumar Tati |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-11T21:52:53Z |
| format | Article |
| id | doaj.art-3183ad2d2de549268d05c08d6f47e881 |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-11T21:52:53Z |
| publishDate | 2016-07-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-3183ad2d2de549268d05c08d6f47e8812022-12-22T00:49:25ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802016-07-01220Proc. Cassting 2016/SynCoP'16778910.4204/EPTCS.220.7:21Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL RequirementsBharath Siva Kumar TatiMarkus Siegle0 UniBw 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.http://arxiv.org/pdf/1608.00658v1 |
| spellingShingle | Bharath Siva Kumar Tati Markus Siegle Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements Electronic Proceedings in Theoretical Computer Science |
| title | Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements |
| title_full | Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements |
| title_fullStr | Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements |
| title_full_unstemmed | Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements |
| title_short | Rate Reduction for State-labelled Markov Chains with Upper Time-bounded CSL Requirements |
| title_sort | rate reduction for state labelled markov chains with upper time bounded csl requirements |
| url | http://arxiv.org/pdf/1608.00658v1 |
| work_keys_str_mv | AT bharathsivakumartati ratereductionforstatelabelledmarkovchainswithuppertimeboundedcslrequirements AT markussiegle ratereductionforstatelabelledmarkovchainswithuppertimeboundedcslrequirements |