نتایج جستجو برای: tpn model atm petri

تعداد نتایج: 2124080  

1999
Boudewijn R. Haverkort Hessel P. Idzenga

We address the performance, in particular, the cell loss ratio, of the ATM GAUSS switch under a variety of realistic video and constant bit rate traac patterns. We describe the operation of the GAUSS switch and derive a stochastic Petri net model for it. One problem with this model, when subjected to realistic traac, is that it is too large (in terms of states of the underlying Markov chain) to...

Journal: :Journal of Systems and Software 1999
Mansour H. A. Jaragh Kassem Saleh

The proliferation of heterogeneous, distributed computer networks has led to an urgent need for constructing reliable and ef®cient communication protocol converter, to facilitate the internetworking between such networks. Most existing converter design methods are based on the communicating ®nite state machine (CFSM) model as the formal description technique to describe the protocols, their ser...

1998
Kishor S. Trivedi Hairong Sun

Continuous-time Markov chains are used extensively to analyze the performance of various computer networks. However, constructing and solving continuous-time Markov chain is a tedious and error-prone procedure, especially when the studied systems are complex. Stochastic Petri nets and the corresponding software packages provide automated generation and solution to continuous-time Markov chains....

Journal: :Neonatology 2008
Matthew J Hyde Encarnación Amusquivar John Laws Anne M Corson Richard R Geering Ian J Lean Guy Putet Peter F Dodds Emilio Herrera Lynne Clarke

BACKGROUND Routine total parenteral nutrition (TPN) in neonatal care can result in hepatic dysfunction in 40-60% of patients, most commonly as fatty liver, but little work has been conducted on the underlying mechanisms causing hepatic dysfunction. OBJECTIVE To use a piglet model for the premature human neonate on TPN, supplemented with lipid emulsions, to investigate hepatic responses. MET...

2012
S. Akshay Loïc Hélouët Claude Jard Didier Lime Olivier H. Roux

This paper addresses robustness issues in Time Petri Nets (TPN) under constraints imposed by an external architecture. The main objective is to check whether a timed specification, given as a TPN behaves as expected when subject to additional time and scheduling constraints, specified by another TPN that constrains the specification via read arcs. Our robustness property says that the constrain...

Journal: :Nutrients 2016
Qiucheng Lei Jingcheng Bi Xinying Wang Tingting Jiang Chao Wu Feng Tian Xuejin Gao Xiao Wan Huijun Zheng

We investigated the effects of exogenous glucagon-like peptide-2 (GLP-2) on mucosal atrophy and intestinal antioxidant capacity in a mouse model of total parenteral nutrition (TPN). Male mice (6-8 weeks old) were divided into three groups (n = 8 for each group): a control group fed a standard laboratory chow diet, and experimental TPN (received standard TPN solution) and TPN + GLP-2 groups (rec...

Journal: :Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées 2019

1994
Boudewijn R. Haverkort Hessel P. Idzenga Byung G. Kim

This paper addresses the modelling and evaluation of cell scheduling policies in ATM multiplexers using stochastic Petri nets. In particular, we compare four cell scheduling policies: a FIFO policy with and without non-preemptive priorities, a threshold priority policy as recently proposed by Lee and Sengupta, and an extension thereof. The aim of this paper is twofold. First, we want to stress ...

2012
Sandie Balaguer Thomas Chatain Stefan Haar

Several formalisms to model distributed real-time systems coexist in the literature. This naturally induces a need to compare their expressiveness and to translate models from one formalism to another when possible. The first formal comparisons of the expressiveness of these models focused on the preservation of the sequential behavior of the models, using notions like timed language equivalenc...

2004
Franck Cassez Olivier H. Roux

In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید