Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks
Date
2003
Authors
Gusak, O.
Dayar T.
Fourneau, J. M.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Performance Evaluation
Print ISSN
0166-5316
Electronic ISSN
1872-745X
Publisher
Elsevier
Volume
53
Issue
1
Pages
43 - 69
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Usage Stats
1
views
views
14
downloads
downloads
Series
Abstract
Stochastic automata networks (SANs) have been developed and used in the last 15 years as a modeling formalism for large systems that can be decomposed into loosely connected components. In this work, we concentrate on the not so much emphasized discrete-time SANs. First, we remodel and extend an SAN that arises in wireless communications. Second, for an SAN with functional transitions, we derive conditions for a special case of ordinary lumpability in which aggregation is done automaton by automaton. Finally, for this class of lumpable discrete-time SANs we devise an efficient aggregation-iterative disaggregation algorithm and demonstrate its performance on the SAN model of interest. © 2002 Elsevier Science B.V. All rights reserved.
Course
Other identifiers
Book Title
Keywords
Discrete-Time Stochastic Automata Networks , Iterative Disaggregation , Ordinary Lumpability , Wireless Asynchronous Transfer Mode System , Automation , Computer Simulation , Discrete Time Control Systems , Iterative Methods , Mathematical Models , Wireless Telecommunication Systems , Iterative Disaggregation , Automata Theory