A uniformization-based algorithm for model checking the CSL until operator on labeled queueing networks

We present a model checking procedure for the CSL until operator on the CTMCs that underlie Jackson queueing networks. The key issue lies in the fact that the underlying CTMC is infinite in as many dimension as there are queues in the JQN. We need to compute the transient state probabilities for all goal states and for all possible starting states. However, for these transient probabilities no computational procedures are readily available. The contribution of this paper is the proposal of a new uniformization-based approach to compute the transient state probabilities. Furthermore, we show how the highly structured state space of JQNs allows us to compute the possible infinite satisfaction set for until formulas. A case study on an e-business site shows the feasibility of our approach

A causal model for linear RF systems developed from frequency-domain measured data

With the ever-growing complexity of interconnect networks, models developed from measured data or data from 3-D electromagnetic simulators are increasingly becoming essential. It is to this end that the current contribution is directed. In particular, it focuses on the development of a model via a Fourier series expansion (FSE) approach. Its primary advantage is that the response in the time domain can be explicitly obtained in a simple form for an arbitrary input using only a set of FSE coefficients. Also, it guarantees causality without requiring a numerical implementation of a Hilbert transform. The end result is a causal and stable time-domain representation of a system that may subsequently be used in a time-domain simulator such as SPICE

A model reduction method for biochemical reaction networks

Background: In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of complexes, defined as the left and right-hand sides of the reactions in the network. It is based on the Kron reduction of the weighted Laplacian matrix, which describes the graph structure of the complexes and reactions in the network. It does not rely on prior knowledge of the dynamic behaviour of the network and hence can be automated, as we demonstrate. The reduced network has fewer complexes, reactions, variables and parameters as compared to the original network, and yet the behaviour of a preselected set of significant metabolites in the reduced network resembles that of the original network. Moreover the reduced network largely retains the structure and kinetics of the original model. Results: We apply our method to a yeast glycolysis model and a rat liver fatty acid beta-oxidation model. When the number of state variables in the yeast model is reduced from 12 to 7, the difference between metabolite concentrations in the reduced and the full model, averaged over time and species, is only 8%. Likewise, when the number of state variables in the rat-liver beta-oxidation model is reduced from 42 to 29, the difference between the reduced model and the full model is 7.5%. Conclusions: The method has improved our understanding of the dynamics of the two networks. We found that, contrary to the general disposition, the first few metabolites which were deleted from the network during our stepwise reduction approach, are not those with the shortest convergence times. It shows that our reduction approach performs differently from other approaches that are based on time-scale separation. The method can be used to facilitate fitting of the parameters or to embed a detailed model of interest in a more coarse-grained yet realistic environment

Cosmic Necklaces from String Theory

We present the properties of a cosmic superstring network in the scenario of flux compactification. An infinite family of strings, the (p,q)-strings, are allowed to exist. The flux compactification leads to a string tension that is periodic in 'p'. Monopoles, appearing here as beads on a string, are formed in certain interactions in such networks. This allows bare strings to become cosmic necklaces. We study network evolution in this scenario, outlining what conditions are necessary to reach a cosmologically viable scaling solution. We also analyze the physics of the beads on a cosmic necklace, and present general conditions for which they will be cosmologically safe, leaving the network's scaling undisturbed. In particular, we find that a large average loop size is sufficient for the beads to be cosmologically safe. Finally, we argue that loop formation will promote a scaling solution for the interbead distance in some situations.Comment: 14 pages, 5 figures; v3, typos corrected, comments added, published versio

Super-Exponential Solution in Markovian Supermarket Models: Framework and Challenge

Marcel F. Neuts opened a key door in numerical computation of stochastic models by means of phase-type (PH) distributions and Markovian arrival processes (MAPs). To celebrate his 75th birthday, this paper reports a more general framework of Markovian supermarket models, including a system of differential equations for the fraction measure and a system of nonlinear equations for the fixed point. To understand this framework heuristically, this paper gives a detailed analysis for three important supermarket examples: M/G/1 type, GI/M/1 type and multiple choices, explains how to derive the system of differential equations by means of density-dependent jump Markov processes, and shows that the fixed point may be simply super-exponential through solving the system of nonlinear equations. Note that supermarket models are a class of complicated queueing systems and their analysis can not apply popular queueing theory, it is necessary in the study of supermarket models to summarize such a more general framework which enables us to focus on important research issues. On this line, this paper develops matrix-analytical methods of Markovian supermarket models. We hope this will be able to open a new avenue in performance evaluation of supermarket models by means of matrix-analytical methods.Comment: Randomized load balancing, supermarket model, matrix-analytic method, super-exponential solution, density-dependent jump Markov process, Batch Markovian Arrival Process (BMAP), phase-type (PH) distribution, fixed poin