Totally open systems of Markovian sequential processes are deened as a subclass of stochastic Petri nets. They can be viewed as a generalization of a subclass of queueing networks in which complex sequential servers can be synchronized according to some particular schemes. Structural analysis of these nets is considered for avoiding the state explotion problem of the embedded Markov chain. Some...

This paper describes the tool CASPA, a new performance evaluation tool which is based on a Markovian stochastic process algebra. CASPA uses multi-terminal binary decision diagrams (MTBDD) to represent the labelled continuous time Markov chain (CTMC) underlying a given process algebraic specification. All phases of modelling, from model construction to numerical analysis and measure computation,...

After giving an overview over various conservation law models for supply networks, this talk will focus on level set approaches to modeling scheduling policies in supply chains. The starting point is a rather high dimensional kinetic model for a density of parts / particles with multidimensional attributes. After deriving hyperbolic conservation laws for the level sets of all parts with equal s...

In this paper, we described a experience of using PEPA eclipse plug-in tool to specify a functional-equivalent representation of a non-repudiation protocol. The model is specified using Markovian process algebra PEPA. The basic model suffers from the well known state space explosion problem when tackled using Continues Time Markov Chain analysis. In order to modelling in a scalable way, functio...

We provide a framework for modeling and analyzing both qualitative and quantitative aspects of mobile ad hoc network (MANET) protocols above the data-link layer. We extend Restricted Broadcast Process Theory [11,9]: delay functions are assigned to actions, while the semantics captures the interplay of a MANET protocol with stochastic behavior of the data-link and physical layer, and the dynamic...

Canonical forms of Markovian distributions and processes provide an efficient way of describing these structures by eliminating the redundancy of general representations. Canonical forms of order 2 stationary Markov arrival processes (MAPs) have already been established for both continuous and discrete time. In this paper we present canonical form of continuous time non-stationary MAPs of order...

ABSTRACT Recently, for energy saving in wireless sensor networks, the data aggregation technique has been proposed. In this paper, we discuss the trade off between communication delay and energy consumption of the technique. At first, we analyze the full aggregation compared with nonaggregation with Markovian chain and simulation. The result shows that non-aggregation method suffers large energ...

This paper models a call center as a Markovian queue with multiple servers, where customer impatience, and retrials are modeled explicitly. The model is analyzed as a continuous time Markov chain. The retrial phenomenon is explored numerically using a real example, to demonstrate the magnitude it can take and to understand its sensitivity to various system parameters. The model is then used to ...

In this paper we study the performance of tree-like splitting collision resolution algorithms in channels with markovian capture. In particular, we assume that in each slot the channel can be in one of two states { b (for \bad") and g (for \good"). When the channel is in state b, a capture can never occur. When the channel is in state g and n nodes (n 2) are transmitting, a capture occurs with ...

In this paper we present a method to perform fast simulation of large Markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach. Résumé. Dans cet article, nous présentons une méthode pour réaliser des simulations ra...