Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
Baier, C. and Haverkort, B.R.H.M. and Hermanns, H. and Katoen, J.P.
(2000)
On the Logical Characterisation of Performability Properties.
In: International Conference on Automata, Languages and Programming (ICALP), 10-14 July 2000, Geneva, Switserland.
pp. 780-792.
Lecture Notes in Computer Science 1853.
Springer.
ISBN 9783540677154
Full text available as:
Official URL: http://www.springerlink.com/content/tcvv76rnlj3f6766/ AbstractMarkov-reward models, as extensions of continuous-time Markov chains, have received increased attention for the specification and evaluation of performance and dependability properties of systems. Until now, however, the specification of reward-based performance and dependability measures has been done manually and informally. In this paper, we change this undesirable situation by the introduction of a continuous-time, reward-based stochastic logic. We argue that this logic is adequate for expressing performability measures of a large variety. We isolate two important sub-logics, the logic CSL [#!ASS+96!#,#!BKH99!#], and the novel logic CRL that allows one to express reward-based properties. These logics turn out to be complementary, which is formally established in our main duality theorem. This result implies that reward-based properties expressed in CRL for a particular Markov reward model can be interpreted as CSL properties over a derived continuo us-time Markov chain, so that model checking procedures for CSL [#!BKH99!#,#!BHHK00!#] can be employed.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
