## Trace Machines for Observing Continuous-Time Markov Chains (2005)

### Cached

### Download Links

- [web.informatik.uni-bonn.de]
- [www.inf.tu-dresden.de]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proc. of the 3rd Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), ENTCS |

Citations: | 5 - 1 self |

### BibTeX

@INPROCEEDINGS{Wolf05tracemachines,

author = {Verena Wolf and Mila Majster-cederbaum and Christel Baier},

title = {Trace Machines for Observing Continuous-Time Markov Chains},

booktitle = {in Proc. of the 3rd Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 2005), ENTCS},

year = {2005}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the probabilities for timed execution paths. Our focus is on testing scenarios by means of push-button experiments with appropriate trace machines and a discussion of the connections between the equivalences. For Markovian trace equivalence, we provide alternative characterizations, including one that abstracts away from the time instances where actions are observed, but just reports on the average sojourn times in the states. This result is used for a reduction of the question whether two finite-state continuous-time Markov chains are Markovian trace equivalent to the probabilistic trace equivalence problem for discrete-time Markov chains (and the latter is known to be solvable in polynomial time).

### Citations

1878 | An Introduction to Probability Theory and its Applications - Feller - 1968 |

596 | A Compositional Approach to Performance Modeling
- Hillston
- 1996
(Show Context)
Citation Context ...,14,12,7,21]. The model used in this paper are continuous-time Markov chains with action labels (ACTMC for short). ACTMCs are widely used as operational model for stochastic process algebras, such as =-=[2,15,9,22]-=-. They can be viewed as ordinary labelled transition systems where the states are augmented with exit rates that specify the (average) residence times in the states. The main contribution of our paper... |

403 | Bisimulation through probabilistic testing
- Larsen, Skou
- 1991
(Show Context)
Citation Context ...kovian trace equivalence. Related work. Although various process equivalences and preorders have been defined for discrete-time or time-abstract probabilistic models, such as (bi)simulation relations =-=[19,28,10,25]-=-, testing relations [6,5,17,24,26] probabilistic trace equivalences [16,23], in the continuous-time setting research has mainly concentrated on branching time relations [15,2,13,4]. Publications on li... |

289 | The linear time - branching time spectrum
- Glabbeek
- 1990
(Show Context)
Citation Context ...tions are defined by “test processes” that interact with the system under consideration, we aim at testing scenarios for ACTMCs by means of pushbutton experiments with a machine model in the style of =-=[27]-=- and [26] for time-abstract probabilistic automata. As pointed out in [26] the use of machine models yields a fully observable characterization of the system which does not only describe the observabl... |

265 | Probabilistic simulations for probabilistic processes
- Segala, Lynch
- 1995
(Show Context)
Citation Context ...kovian trace equivalence. Related work. Although various process equivalences and preorders have been defined for discrete-time or time-abstract probabilistic models, such as (bi)simulation relations =-=[19,28,10,25]-=-, testing relations [6,5,17,24,26] probabilistic trace equivalences [16,23], in the continuous-time setting research has mainly concentrated on branching time relations [15,2,13,4]. Publications on li... |

230 |
Modeling and verification of randomized distributed real-time systems
- Segala
- 1995
(Show Context)
Citation Context ... preorders have been defined for discrete-time or time-abstract probabilistic models, such as (bi)simulation relations [19,28,10,25], testing relations [6,5,17,24,26] probabilistic trace equivalences =-=[16,23]-=-, in the continuous-time setting research has mainly concentrated on branching time relations [15,2,13,4]. Publications on linear time relations and testing scenarios for continuous-time Markov models... |

168 |
Modeling and Analysis of Stochastic Systems
- Kulkarni
- 1995
(Show Context)
Citation Context ...ce are considered in Section 5. The paper ends with a brief summary in Section 6. Throughout the paper, we assume some familiarity with basic notions of probability theory and Markov chains, see e.g. =-=[18,11]-=-. 2 Preliminaries: exponential distributions Let X be a continuous random variable and q ∈ R>0. X is exponentially distributed with parameter q if the probability that X is less or equal t ∈ R≥0 is gi... |

147 |
Time and probability in formal design of distributed systems
- Hansson
- 1994
(Show Context)
Citation Context ...kovian trace equivalence. Related work. Although various process equivalences and preorders have been defined for discrete-time or time-abstract probabilistic models, such as (bi)simulation relations =-=[19,28,10,25]-=-, testing relations [6,5,17,24,26] probabilistic trace equivalences [16,23], in the continuous-time setting research has mainly concentrated on branching time relations [15,2,13,4]. Publications on li... |

104 |
Stochastic π-calculus
- Priami
- 1995
(Show Context)
Citation Context ...,14,12,7,21]. The model used in this paper are continuous-time Markov chains with action labels (ACTMC for short). ACTMCs are widely used as operational model for stochastic process algebras, such as =-=[2,15,9,22]-=-. They can be viewed as ordinary labelled transition systems where the states are augmented with exit rates that specify the (average) residence times in the states. The main contribution of our paper... |

71 |
Interactive Markov Chains and the Quest for Quantified Quality. Volume 2428 of LNCS
- Hermanns
- 2002
(Show Context)
Citation Context ...ulation relations [19,28,10,25], testing relations [6,5,17,24,26] probabilistic trace equivalences [16,23], in the continuous-time setting research has mainly concentrated on branching time relations =-=[15,2,13,4]-=-. Publications on linear time relations and testing scenarios for continuous-time Markov models are rare. An exception is the work by Bernardo and Cleaveland [1] where testing relations are studied fo... |

50 |
Testing Preorders for Probabilistic Processes
- Cleaveland, Dayar, et al.
- 1999
(Show Context)
Citation Context ... work. Although various process equivalences and preorders have been defined for discrete-time or time-abstract probabilistic models, such as (bi)simulation relations [19,28,10,25], testing relations =-=[6,5,17,24,26]-=- probabilistic trace equivalences [16,23], in the continuous-time setting research has mainly concentrated on branching time relations [15,2,13,4]. Publications on linear time relations and testing sc... |

47 | 2002): Testing preorders for probabilistic processes can be characterized by simulations. Theoret - Jonsson, Wang |

45 |
Performance of Computer Communication Systems: A Model-Based Approach
- Haverkort
- 1998
(Show Context)
Citation Context ...ce are considered in Section 5. The paper ends with a brief summary in Section 6. Throughout the paper, we assume some familiarity with basic notions of probability theory and Markov chains, see e.g. =-=[18,11]-=-. 2 Preliminaries: exponential distributions Let X be a continuous random variable and q ∈ R>0. X is exponentially distributed with parameter q if the probability that X is less or equal t ∈ R≥0 is gi... |

45 | A Markov chain model checker
- Hermanns, Katoen, et al.
- 2000
(Show Context)
Citation Context ...for the design and analysis of stochastic systems (see e.g. [3] for an overview) and applied e.g. for reasoning about communication systems, biological systems or mobile multi-agent systems, see e.g. =-=[20,14,12,7,21]-=-. The model used in this paper are continuous-time Markov chains with action labels (ACTMC for short). ACTMCs are widely used as operational model for stochastic process algebras, such as [2,15,9,22].... |

44 | Compositionality for Probabilistic Automata
- Lynch, Segala, et al.
- 2003
(Show Context)
Citation Context ... work. Although various process equivalences and preorders have been defined for discrete-time or time-abstract probabilistic models, such as (bi)simulation relations [19,28,10,25], testing relations =-=[6,5,17,24,26]-=- probabilistic trace equivalences [16,23], in the continuous-time setting research has mainly concentrated on branching time relations [15,2,13,4]. Publications on linear time relations and testing sc... |

43 | R.: Extended markovian process algebra
- Bernardo, Gorrieri
- 1996
(Show Context)
Citation Context ...,14,12,7,21]. The model used in this paper are continuous-time Markov chains with action labels (ACTMC for short). ACTMCs are widely used as operational model for stochastic process algebras, such as =-=[2,15,9,22]-=-. They can be viewed as ordinary labelled transition systems where the states are augmented with exit rates that specify the (average) residence times in the states. The main contribution of our paper... |

41 |
Testing Equivalences and fully abstract models for Probabilistic Processes
- Christoff
- 1990
(Show Context)
Citation Context ... work. Although various process equivalences and preorders have been defined for discrete-time or time-abstract probabilistic models, such as (bi)simulation relations [19,28,10,25], testing relations =-=[6,5,17,24,26]-=- probabilistic trace equivalences [16,23], in the continuous-time setting research has mainly concentrated on branching time relations [15,2,13,4]. Publications on linear time relations and testing sc... |

30 |
Tipp – a language for timed processes and performance evaluation
- Götz, Herzog, et al.
- 1992
(Show Context)
Citation Context |

23 | Automatic verification of the IEEE 1394 root contention protocol with
- Daws, Kwiatkowska, et al.
(Show Context)
Citation Context ...for the design and analysis of stochastic systems (see e.g. [3] for an overview) and applied e.g. for reasoning about communication systems, biological systems or mobile multi-agent systems, see e.g. =-=[20,14,12,7,21]-=-. The model used in this paper are continuous-time Markov chains with action labels (ACTMC for short). ACTMCs are widely used as operational model for stochastic process algebras, such as [2,15,9,22].... |

17 |
On some equivalence relations for probabilistic processes
- Huynh, Tian
- 1992
(Show Context)
Citation Context ...e problem of whether two ACTMCs are Markovian trace equivalent to the discrete-time case, where the corresponding notion of probabilistic trace equivalence is known to be decidable in polynomial time =-=[16]-=-. Finally, we discuss Markovian variants of failure and ready trace equivalence which turn out to agree and to be refinements of Markovian trace equivalence. Related work. Although various process equ... |

14 | H.: Continuous-time probabilistic KLAIM
- Pierro, Hankin, et al.
(Show Context)
Citation Context ...for the design and analysis of stochastic systems (see e.g. [3] for an overview) and applied e.g. for reasoning about communication systems, biological systems or mobile multi-agent systems, see e.g. =-=[20,14,12,7,21]-=-. The model used in this paper are continuous-time Markov chains with action labels (ACTMC for short). ACTMCs are widely used as operational model for stochastic process algebras, such as [2,15,9,22].... |

13 | A theory of testing for Markovian processes
- Bernardo, Cleaveland
(Show Context)
Citation Context ...ed on branching time relations [15,2,13,4]. Publications on linear time relations and testing scenarios for continuous-time Markov models are rare. An exception is the work by Bernardo and Cleaveland =-=[1]-=- where testing relations are studied for EMPA-processes. Unlike [1], where testing relations are defined by “test processes” that interact with the system under consideration, we aim at testing scenar... |

12 | A testing scenario for probabilistic automata
- Stoelinga, Vaandrager
- 2003
(Show Context)
Citation Context |

11 | Probabilistic asynchronous pi-calculus
- Herescu, Palamidessi
- 2004
(Show Context)
Citation Context |

2 |
editors. Lectures on formal methods and performance analysis
- Brinksma, Hermanns, et al.
- 2001
(Show Context)
Citation Context ...wn to be solvable in polynomial time). 1 Introduction In the past 15 years, various process calculi and temporal logics have been developed for the design and analysis of stochastic systems (see e.g. =-=[3]-=- for an overview) and applied e.g. for reasoning about communication systems, biological systems or mobile multi-agent systems, see e.g. [20,14,12,7,21]. The model used in this paper are continuous-ti... |

2 |
Comparative branching time semantics for Markov chains
- Baier, Hermanns, et al.
- 2003
(Show Context)
Citation Context ...ulation relations [19,28,10,25], testing relations [6,5,17,24,26] probabilistic trace equivalences [16,23], in the continuous-time setting research has mainly concentrated on branching time relations =-=[15,2,13,4]-=-. Publications on linear time relations and testing scenarios for continuous-time Markov models are rare. An exception is the work by Bernardo and Cleaveland [1] where testing relations are studied fo... |

2 | Semantic-driven performance evaluation
- NOTTEGAR, PRIAMI, et al.
- 1999
(Show Context)
Citation Context |

2 |
stratified models of probabilistic processes
- Reactive
- 1990
(Show Context)
Citation Context |