Abstract. We study long run average behavior of generalized semi-Markov pro-cesses with both fixed-delay events as well as variable-delay events. We show that allowing two fixed-delay events and one variable-delay event may cause an unsta-ble behavior of a GSMP. In particular, we show that a frequency of a given state may not be defined for almost all runs (or more generally, an invariant measure may not exist). We use this observation to disprove several results from litera-ture. Next we study GSMP with at most one fixed-delay event combined with an arbitrary number of variable-delay events. We prove that such a GSMP always possesses an invariant measure which means that the frequencies of states are always well defined and we provide algo...
AbstractIn this paper we address the problem of adequately handling non-deterministic choices in Gen...
In this paper we give some general, but easy-to-check, conditions guaranteeing the quasi-stationarit...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...
We study a fundamental feature of the generalized semi-Markov processes (GSMPs), called event coupli...
AbstractIn this paper we introduce the calculus of interactive generalized semi-Markov processes (IG...
none1noWe present a theory for the design and analysis of concurrent/distributed systems with real...
This paper present methodological results that allow the cost-effective numerical analysis of finite...
A semi‐Markov process is a generalization of continuous‐time Markov chain, so that the sojourn times...
Structural properties of generalised semi-Markov processes (GSMP) have been successfully studied in ...
This report introduces a new model for event-driven temporal sequence processing: Generalized Hidden...
We consider the problem of verifying reachability properties of stochastic real-time systems modeled...
We discuss the dynamics of continuous time semi-markov chains with phase-type waiting times. It is s...
This paper is an informal tutorial on stochastic process algebras, i.e., process calculi where actio...
A semi-Markov process X(t) may be viewed as constructed from a two-dimensional process J(,n),W(,n) w...
Abstract. We consider the problem of verifying reachability properties of stochastic real-time syste...
AbstractIn this paper we address the problem of adequately handling non-deterministic choices in Gen...
In this paper we give some general, but easy-to-check, conditions guaranteeing the quasi-stationarit...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...
We study a fundamental feature of the generalized semi-Markov processes (GSMPs), called event coupli...
AbstractIn this paper we introduce the calculus of interactive generalized semi-Markov processes (IG...
none1noWe present a theory for the design and analysis of concurrent/distributed systems with real...
This paper present methodological results that allow the cost-effective numerical analysis of finite...
A semi‐Markov process is a generalization of continuous‐time Markov chain, so that the sojourn times...
Structural properties of generalised semi-Markov processes (GSMP) have been successfully studied in ...
This report introduces a new model for event-driven temporal sequence processing: Generalized Hidden...
We consider the problem of verifying reachability properties of stochastic real-time systems modeled...
We discuss the dynamics of continuous time semi-markov chains with phase-type waiting times. It is s...
This paper is an informal tutorial on stochastic process algebras, i.e., process calculi where actio...
A semi-Markov process X(t) may be viewed as constructed from a two-dimensional process J(,n),W(,n) w...
Abstract. We consider the problem of verifying reachability properties of stochastic real-time syste...
AbstractIn this paper we address the problem of adequately handling non-deterministic choices in Gen...
In this paper we give some general, but easy-to-check, conditions guaranteeing the quasi-stationarit...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...