#### Filter Results:

- Full text PDF available (33)

#### Publication Year

2008

2017

- This year (1)
- Last 5 years (19)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Taolue Chen, Marco Diciolla, Marta Z. Kwiatkowska, Alexandru Mereacre
- Inf. Comput.
- 2014

Article history: Available online xxxx

This paper proposes a technique to synthesize parametric rate values in continuous-time Markov chains that ensure the validity of bounded reachability properties. Rate expressions over variables indicate the average speed of state changes and are expressed using the polynomials over reals. The key contribution is an algorithm that approximates the set of… (More)

- Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre
- Logical Methods in Computer Science
- 2011

We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions. The central question that we address is: what is the probability of the set of paths of C that are accepted by A, i.e., the likelihood that C… (More)

This paper makes verifying continuous-time Markov chains (CTMCs) against deterministic timed automata (DTA) objectives practical. We show that verifying 1-clock DTA can be done by analyzing subgraphs of the product of CTMC C and the region graph of DTA A. This improves upon earlier results and allows to use standard analysis algorithms. Our graph… (More)

- Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre
- 2009 24th Annual IEEE Symposium on Logic In…
- 2009

We study the following problem: given a continuous-time Markov chain (CTMC) C, and a linear real-time property provided as a deterministic timed automaton (DTA) A, what is the probability of the set of paths of C that are accepted by A (C satisfies A)? It is shown that this set of paths is measurable and computing its probability can be reduced to computing… (More)

This paper considers the quantitative verification of discrete-time stochastic hybrid systems (DTSHS) against linear time objectives. The central question is to determine the likelihood of all the trajectories in a DTSHS that are accepted by an automaton on finite or infinite words. This verification covers regular and ω-regular properties, and thus… (More)

- Taolue Chen, Marco Diciolla, Marta Z. Kwiatkowska, Alexandru Mereacre
- FORMATS
- 2011

In this paper we study time-bounded verification of a finite continuoustime Markov chain (CTMC) C against a real-time specification, provided either as a metric temporal logic (MTL) property φ, or as a timed automaton (TA) A. The key question is: what is the probability of the set of timed paths of C that satisfy φ (or are accepted by A) over a time… (More)

This paper presents a compositional framework for the modeling of interactive continuous-time Markov chains with time-dependent rates, a subclass of communicating piecewise deterministic Markov processes. A poly-time algorithm is presented for computing the coarsest quotient under strong bisimulation for rate functions that are either piecewise uniform or… (More)

Implantable medical devices, such as cardiac pacemakers, must be designed and programmed to the highest levels of safety and reliability. Recently, errors in embedded software have led to a substantial increase in safety alerts, costly device recalls or even patient death. To address such issues, we propose a model-based framework for quantitative,… (More)

- M Jongerden, A Mereacre, H Bohnenkamp, B Haverkort, J Katoen
- IEEE Transactions on Industrial Informatics
- 2010

The use of mobile devices is often limited by the battery lifetime. Some devices have the option to connect an extra battery, or to use smart battery-packs with multiple cells to extend the lifetime. In these cases, scheduling the batteries or battery cells over the load to exploit the recovery properties of the batteries helps to extend the overall systems… (More)