G Su, T Chen, Y Feng… - 2017 IEEE/ACM 39th …, 2017 - ieeexplore.ieee.org
Software systems, especially service-based software systems, need to guarantee runtime performance. If their performance is degraded, some reconfiguration countermeasures …
C Paterson, R Calinescu - 2017 IEEE International Conference …, 2017 - ieeexplore.ieee.org
We introduce a tool-supported method for the automated refinement of continuous-time Markov chains (CTMCs) used to assess quality properties of component-based software …
Various algorithms and tools for the formal verification of systems with respect to their quantitative behavior have been developed in the past decades. Many of these techniques …
Labeled continuous-time Markov chains (CTMCs) describe processes subject to random timing and partial observability. In applications such as runtime monitoring, we must …
B Liu, X Wang, C Chen, Z Ma - KSCE Journal of Civil Engineering, 2014 - Springer
Abstract The Communist Party of China proposed the concept of “speeding up the industrial transformation and changing economic development mode” in its 17 th Congress. Against …
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise …
Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such …
Continuous-time Markov chains with alarms (ACTMCs) allow for alarm events that can be non-exponentially distributed. Within parametric ACTMCs, the parameters of alarm-event …