Object-Oriented Computer Simulation of Discrete-Event Systems

Object-Oriented Computer Simulation of Discrete-Event Systems offers a comprehensive presentation of a wide repertoire of computer simulation techniques available to the modelers of dynamic systems. Unlike other books on simulation, this book includes a c

  • PDF / 24,212,381 Bytes
  • 262 Pages / 439 x 666 pts Page_size
  • 4 Downloads / 250 Views

DOWNLOAD

REPORT


THE KLUWER INTERNATIONAL SERIES ON DISCRETE EVENT DYNAMIC SYSTEMS

Series Editor

Yu-Chi Ho Harvard University TIMED PETRI NETS: Theory and Application Jiacun Wang ISBN: 0-7923-8270-6

GRADIENT ESTIMATION VIA PERTURBATION ANALYSIS P. Glasserman ISBN: 0-7923-9095-4

PERTURBATION ANALYSIS OF DISCRETE EVENT DYNAMIC SYSTEMS Yu-Chi Ho and Xi-Ren Cao ISBN: 0-7923-9174-8

PETRI NET SYNTHESIS FOR MANUFACTURING SYSTEMS

DISCRETE

EVENT

CONTROL

OF

MengChu Zhou and Frank DiCesare ISBN: 0-7923-9289-2

MODELING AND CONTROL OF LOGICAL DISCRETE EVENT SYSTEMS Ratnesh Kumar and Vijay K. Garg ISBN: 0-7923-9538-7

UNIFORM RANDOM NUMBERS: THEORY AND PRACTICE Shu Tezuka ISBN: 0-7923-9572-7

OPTIMIZATION OF STOCHASTIC MODELS: THE INTERFACE BETWEEN SIMULATION AND OPTIMIZATION Georg Ch. Pflug ISBN: 0-7923-9780-0

CONDITIONAL MONTE CARLO: OPTIMIZATION APPLICATIONS

GRADIENT

ESTIMATION

AND

Michael FU and Jian-Qiang HU ISBN: 0-7923-9873-4

SUPERVISORY CONTROL OF DISCRETE EVENT SYSTEMS USING PETRI NETS John O. Moody and Panos J. Antsaklis ISBN: 0-7923-8199-8

Object-Oriented Computer Simulation of Discrete-Event Systems Jerzy Tyszer Poznan University of Technology, Poznan, Poland

SPRINGER SCIENCE+BUSINESS MEDIA, LLC

ISBN 978-1-4613-7287-5

ISBN 978-1-4615-5033-4 (eBook)

DOI 10.1007/978-1-4615-5033-4

Library of Congress Cataloging-in-Publication Data A C.I.P. Catalogue record for this book is available from the Library of Congress. Copyright © 1999 by Springer Science+Business Media New York Originally published by Kluwer Academic Publishers in 1999 Softcover reprint ofthe hardcover Ist edition 1999 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher, Springer Science+Business Media, LLC. Printed on acid-free paper.

To Dorota and Janusz

Contents

Preface 1

xi

Getting started

1

1.1 Basic notions 1.2 Manual simulation 1.3 Activity scanning.

2 5 9

2 Event scheduling 2.1 Main paradigm · .... 2.2 ABC approach · .... 2.3 Events versus activities

17

3 Event lists 3.1 Doubly linked linear list 3.2 Indexed linear list 3.3 Henriksen's list · ... 3.4 Two-level indexed list 3.5 Heaps ......... 3.6 Splay trees ...... 3.7 Run-time efficiency of event scheduling.

29

4

Process interaction 4.1 Basic operations 4.2 Environment in C++ 4.3 Distributed simulation 4.3.1 Decomposition of a simulation 4.3.2 Conservative mechanisms ...

18 24 25 30 35 39 42 48 52 58 65

66 68 77 77

79

viii

Contents 4.3.3

5

Optimistic mechanisms

83 87 88

Random number generators 5.1 Uniform random variables 5.2 Statistical tests . . . . . . . 5.2.1 Chi-square test .. . 5.2.2 Kolmogorov-Smirnov test 5.2.3 Poker test . . . . . . . . 5.2.4 Runs test . . . . . . . . 5.2.5 Coupon's collector test. 5.2.6 Gap test . . . . . . . . . 5.2.7 Autocorrelation test .. 5.3 Non-uniform variate generation 5.3.1 Inverse transformation method 5.3.2 Convolution . . . . 5.3.3 Reje