EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||
|
Haverkort, B.R.H.M. and Cloth, L. and Hermanns, H. and Katoen, J.P. and Baier, C.
(2002)
Model-checking performability properties.
In: International IEEE Conference on Dependable Systems and Networks (DSN), 23-26 June 2002, Bethesda, MD, USA.
pp. 103-112.
IEEE Computer Society.
ISBN 0-7695-1597-5
Full text available as:
Official URL: http://dx.doi.org/10.1109/DSN.2002.1028891 AbstractModel checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a formally-specified system. We present a number of computational procedures to perform model checking of continuous stochastic reward logic (CSRL) over finite Markov reward models, thereby stressing their computational complexity (time and space) and applicability from a practical point of view (accuracy, stability). A case study in the area of ad hoc mobile computing under power constraints shows the merits of CSRL and the new computational procedures.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||