TY - BOOK

T1 - Extending the Logic IM-SPDL with Impulse and State Rewards

AU - Haverkort, Boudewijn R.

AU - Kuntz, Matthias

PY - 2007/9

Y1 - 2007/9

N2 - This report presents the logic SDRL (Stochastic Dynamic Reward Logic), an extension of the stochastic logic IM-SPDL, which supports the specication of complex performance and dependability requirements. SDRL extends IM-SPDL with the possibility to express impulse- and state reward measures.
The logic is interpreted over extended action-based Markov reward model (EMRM), i.e. transition systems containing both immediate and Markovian transitions, where additionally the states and transitions can be enriched with rewards.
We define ne the syntax and semantics of the new logic and show that SDRL provides powerful means to specify path-based properties with timing and reward-based restrictions.
In general, paths can be characterised by regular expressions, also called programs, where the executability of a program may depend on the validity of test formulae. For the model checking of SDRL time- and reward-bounded path formulae, a deterministic program automaton is constructed from the requirement. Afterwards the product transition
system between this automaton and the EMRM is built and subsequently transformed into a continuous time Markov reward model (MRM) on which numerical
analysis is performed.

AB - This report presents the logic SDRL (Stochastic Dynamic Reward Logic), an extension of the stochastic logic IM-SPDL, which supports the specication of complex performance and dependability requirements. SDRL extends IM-SPDL with the possibility to express impulse- and state reward measures.
The logic is interpreted over extended action-based Markov reward model (EMRM), i.e. transition systems containing both immediate and Markovian transitions, where additionally the states and transitions can be enriched with rewards.
We define ne the syntax and semantics of the new logic and show that SDRL provides powerful means to specify path-based properties with timing and reward-based restrictions.
In general, paths can be characterised by regular expressions, also called programs, where the executability of a program may depend on the validity of test formulae. For the model checking of SDRL time- and reward-bounded path formulae, a deterministic program automaton is constructed from the requirement. Afterwards the product transition
system between this automaton and the EMRM is built and subsequently transformed into a continuous time Markov reward model (MRM) on which numerical
analysis is performed.

M3 - Report

T3 - CTIT Technical Report Series

BT - Extending the Logic IM-SPDL with Impulse and State Rewards

PB - Centre for Telematics and Information Technology (CTIT)

CY - Enschede

ER -