IEEE CONTROL SYSTEMS SOCIETY WORKING GROUP
ON DISCRETE EVENT SYSTEMS
Newsletter........................................................April, 1994
Editor: Edwin K. P. Chong
_._________________________________________________________________________._
Contents:
1. Editorial
2. Books
2.1 SYNCHRONIZATION AND LINEARITY: AN ALGEBRA FOR DISCRETE EVENT SYSTEMS
F. Baccelli, G. Cohen, G.J. Olsder, J.-P. Quadrat
2.2 DISCRETE EVENT SYSTEMS: MODELING AND PERFORMANCE ANALYSIS
Christos G. Cassandras
2.3 Book review announcement:
Discrete Event Systems: Modeling and Performance Analysis,
Christos G. Cassandras (reviewed by E.K.P. Chong)
3. Journals
3.1 Table of contents: DISCRETE EVENT DYNAMIC SYSTEMS: THEORY AND
APPLICATIONS
4. Conferences
4.1 Call for Papers: (HKIWNDCM'94) 1994 Hong Kong International
Workshop on New Directions of Control and Manufacturing
(Nov. 7-9, 1994, Hong Kong)
4.2 11TH INTERNATIONAL CONFERENCE ON ANALYSIS & OPTIMISATION OF
SYSTEMS
_._________________________________________________________________________._
Editorial
_._________________________________________________________________________._
Welcome to the newsletter of the IEEE Control Systems Society Working
Group on Discrete Event Systems!
First, to introduce myself, I am Edwin K. P. Chong, newly appointed
chair of the IEEE CSS Working Group on DES (DES WG).
To contact me, use:
Prof. Edwin K. P. Chong
Chair, IEEE CSS Working Group on DES
School of Electrical Engineering
Purdue University
1285 Electrical Engineering Bldg.
West Lafayette, IN 47907-1285
Phone: (317) 494-9143
Fax: (317) 494-6440
e-mail: echong@ecn.purdue.edu
One of the objectives of the DES WG is to promote communication between
DES researchers, scholars, students, and practitioners.
At present, the e-mail list for the DES WG is incomplete, and I have
the task of building up a list that is as complete as possible. Please
spread the word (forward this entire newsletter if you like), and invite
those interested to send e-mail to me (echong@ecn.purdue.edu) so that I can
include their e-mail addresses in the mailing list. I plan to release this
e-mail newsletter regularly, but with as yet unknown frequency. I
also wish to encourage participation by submitting contributions
(announcements, articles, etc.) to the newsletter. Again, just send
them to me by e-mail. Examples of contributions include
announcements on:
- Conferences
- Workshops
- Special sessions
- Publications
- Courses
- Personals
- Job opportunities and positions
Those of you who receive the E-Letter will notice that the format of
this newsletter is similar. Notice the delimiter between
articles/contributions. In particular, if you are using an editor to
read this article, you can go directly to the delimiter by searching
for the string "_.__" (underscore,period,underscore,underscore).
This feature is useful for quickly skipping to the next item.
*--------*
The field of DES continues to be flourishing, with at least one
session dealing with DES at every major conference I can think of. In
particular, DES sessions at the following recent conferences come to mind:
- 1993 American Control Conference, San Francisco, California,
June 2--4, 1993
- Conference on Applied Probability in Engineering, Computer and
Communication Sciences}, sponsored by INRIA/ORSA/TIMS/SMAI,
Paris, France, June 16--18, 1993
- 36th IEEE Midwest Symposium on Circuits and Systems, Detroit,
Michigan, August 16--18, 1993
- 8th IEEE International Symposium on Intelligent Control,
Chicago, Illinois, August 25--27, 1993
- 31st Annual Allerton Conference on Communication, Control and Computing,
Monticello, Illinois, September 29--October 1, 1993
- ORSA/TIMS Joint National Meeting, Phoenix, Arizona,
October 31--November 3, 1993
- 32nd IEEE Conference on Decision and Control, San Antonio,
Texas, December 15--17, 1993
- 28th Annual Conference on Information Sciences and Systems,
Princeton, New Jersey, March 16--18, 1994
In addition, the following special workshops were held recently (I am
sure there were more that I am not aware of, which is a good reason to
have this DES WG Newsletter as a way of promoting awareness):
- "Belgium-France-Holland DES Summer School", held in June 1993,
in Spa, Belgium, which lasted a week and included lectures form
several experts addressed to GRAD. STUDENTS exclusively.
- Institute for Mathematics and Its Applications Workshop on
Discrete Event Systems, University of Minnesota, Minneapolis,
Minnesota, May 10--14, 1993
I am also aware of an upcoming INRIA DES conference, to be held in
June 1994. Do look out for such sessions/workshops in future meetings,
and please let me know. I am sure there are several being planned.
_._________________________________________________________________________._
Books
_._________________________________________________________________________._
Contributed by: Guy Cohen (cohen@cas.ensmp.fr)
SYNCHRONIZATION AND LINEARITY:
AN ALGEBRA FOR DISCRETE EVENT SYSTEMS
F. Baccelli
G. Cohen
G.J. Olsder
J.-P. Quadrat
Wiley & Sons, 1992 -- 490 pages
Table of Contents
Preface
Part I: Discrete Event Systems and Petri Nets
Chapter 1: Introduction and Motivation
1.1 Preliminary Remarks and Some Notation
1.2 Miscellaneous Examples
1.3 Issues and Problems in Performance Evaluation
1.4 Notes
Chapter 2: Graph Theory and Petri Nets
2.1 Introduction
2.2 Directed Graphs
2.3 Graphs and Matrices
2.4 Petri Nets
2.5 Timed Event Graphs
2.6 Modeling Issues
2.7 Notes
Part II: Algebra
Chapter 3: Max-Plus Algebra
3.1 Introduction
3.2 Matrices in R_max
3.3 Scalar Functions in R_max
3.4 Symmetrization of the Max-Plus Algebra
3.5 Linear Systems in S
3.6 Polynomials with Coefficients in S
3.7 Asymptotic Behavior of A^k
3.8 Notes
Chapter 4: Dioids
4.1 Introduction
4.2 Basic Definitions and Examples
4.3 Lattice Properties of Dioids
4.4 Isotone Mappings and Residuation
4.5 Fixed-Point Equations, Closure of Mappings and Best Approximation
4.6 Matrix Dioids
4.7 Dioids of Polynomials and Power Series
4.8 Rational Closure and Rational Representations
4.9 Notes
Part III: Deterministic System Theory
Chapter 5: Two-Dimensional Domain Description of Event Graphs
5.1 Introduction
5.2 A Comparison Between Counter and Dater Descriptions
5.3 Daters and their Embedding in Nonmonotonic Functions
5.4 Moving to the Two-Dimensional Description
5.5 Counters
5.6 Backward Equations
5.7 Rationality, Realizability and Periodicity
5.8 Frequency Response of Event Graphs
5.9 Notes
Chapter 6: Max-Plus Linear System Theory
6.1 Introduction
6.2 System Algebra
6.3 Impulse Responses of Linear Systems
6.4 Transfer Functions
6.5 Rational Systems
6.6 Correlations and Feedback Stabilization
6.7 Notes
Part IV: Stochastic Systems
Chapter 7: Ergodic Theory of Event Graphs
7.1 Introduction
7.2 A Simple Example in R_max
7.3 First-Order Theorems
7.4 Second-Order Theorems; Nonautonomous Case
7.5 Second-Order Theorems; Autonomous Case
7.6 Stationary Marking of Stochastic Event Graphs
7.7 Appendix on Ergodic Theorems
7.8 Notes
Chapter 8: Computational Issues in Stochastic Event Graphs
8.1 Introduction
8.2 Monotonicity Properties
8.3 Event Graphs and Branching Processes
8.4 Markovian Analysis
8.5 Appendix: Stochastic Comparison and Markov Chains
8.6 Notes
Part V: Postface
Chapter 9: Related Topics and Open Ends
9.1 Introduction
9.2 About Realization Theory
9.3 Control of Discrete Event Systems
9.4 Brownian and Diffusion Decision Processes
9.5 Evolution Equations of General Timed Petri Nets
9.6 Min-Max Systems
9.7 About Cycle Times in General Petri Nets
9.8 Notes
Bibliography
Notation
Index
-o-o- Extracted from the preface -o-o-
The mathematical theory developed in this book finds its
initial motivation in the modeling and the analysis of
the time behavior of a class of dynamic systems now
often referred to as `discrete event (dynamic) systems'
(DEDS). This class essentially contains man-made systems
that consist of a finite number of resources (processors
or memories, communication channels, machines) shared by
several users (jobs, packets, manufactured objects)
which all contribute to the achievement of some common
goal (a parallel computation, the end-to-end
transmission of a set of packets, the assembly of a
product in an automated manufacturing line). The
coordination of the user access to these resources
requires complex control mechanisms which usually make
it impossible to describe the dynamic behavior of such
systems in terms of differential equations, as in
physical phenomena. The dynamics of such systems can in
fact be described using the two (Petri net like)
paradigms of `synchronization' and `concurrency'.
Synchronization requires the availability of several
resources or users at the same time, whereas concurrency
appears for instance when, at a certain time, some user
must choose among several resources.
The thesis developed here is that there exists an
algebra in which DEDS that do not involve concurrency
can naturally be modeled as linear systems.
Conventional system theory studies networks of
integrators or `adders' connected in series, parallel
and feedback. Similarly, queuing theory or Petri net
theory build up complex systems from elementary objects
(namely, queues, or transitions and places). The theory
proposed here studies complex systems which are made up
of elementary systems interacting through a basic
operation, called synchronization, located at the nodes
of a network.
The mathematical contributions of the book can be viewed
as the first steps toward the development of a theory of
linear systems on dioids. Both deterministic and
stochastic systems are considered. Classical concepts of
system theory such as `state space' recursive equations,
input-output (transfer) functions, feedback loops, etc.
are introduced. Overall, this theory offers a unifying
framework for systems in which the basic `engine' of
dynamics is synchronization, when these systems are
considered from the point of view of performance
evaluation. In other words, dioid algebra appears to be
the right tool to handle synchronization in a linear
manner, whereas this phenomenon seems to be very
nonlinear, or even nonsmooth, `through the glasses' of
conventional algebraic tools. Moreover, this theory may
be a good starting point to encompass other basic
features of discrete event systems such as concurrency,
but at the price of considering systems which are
nonlinear even in this new framework.
Although the initial motivation was essentially found in
the study of discrete event systems, it turns out that
this theory may be appropriate for other purposes too.
This happens frequently with mathematical theories which
often go beyond their initial scope, as long as other
objects can be found with the same basic features. In
this particular case the common feature may be expressed
by saying that the input-output relation has the form of
an inf- (or a sup-) convolution. In the same way, the
scope of conventional system theory is the study of
input-output relations which are convolutions. In
Chapter 1 it is suggested that this theory is also
relevant for some systems which either are continuous or
do not involve synchronization. Systems which mix fluids
in certain proportions and which involve flow
constraints fall in the former category. Recursive
`optimization processes', of which dynamic programming
is the most immediate example, fall in the latter
category. All these systems involve max (or min) and +
as the basic operations. Another situation where dioid
algebra naturally shows up is the asymptotic behavior of
exponential functions. In mathematical terms, the
conventional operations + and x over positive numbers,
say, are transformed into max and +, respectively, by
the mapping: x- lim exp(sx) when s - infinity. This is
relevant, for example, in the theory of large
deviations, and, coming back to conventional system
theory, when outlining Bode diagrams by their
asymptotes.
The heart of the book consists of four main parts, each
of which consists of two chapters. the first part
(Chapters 1 and 2) provides a natural motivation for
DEDS, it is devoted to a general introduction and
relationships with graph theory and Petri nets. The
second part (Chapters 3 and 4) is devoted to the
underlying algebras. The third part (Chapters 5 and 6)
deals with deterministic system theory, where the
systems are mostly DEDS, but continuous max-plus linear
systems also are discussed in Chapter 6. The fourth part
(Chapters 7 and 8) deals with stochastic DEDS. Many
interplays of comparable results between the
deterministic and the stochastic framework are shown.
There is a fifth part, consisting of one chapter
(Chapter 9), which deals with related areas and some
open problems.
_._________________________________________________________________________._
Contributed by: Christos Cassandras (CASSANDRAS@CCS23.ECS.UMASS.EDU)
DISCRETE EVENT SYSTEMS: MODELING AND PERFORMANCE ANALYSIS
Christos G. Cassandras
CHAPTER 1: Systems and Models
1.1 INTRODUCTION
1.2 SYSTEMS AND CONTROL BASICS
1.2.1 The Concept of System
1.2.2 The Input-Output Modeling Process
Static and Dynamic Systems
Time-varying and Time-invariant Dynamic Systems
1.2.3 The Concept of State
1.2.4 The State Space Modeling Process
Linear and Nonlinear Systems
1.2.5 Sample Paths of Dynamic Systems
1.2.6 State Spaces
Continuous-State and Discrete-State Systems
Deterministic and Stochastic Systems
1.2.7 The Concept of Control
1.2.8 The Concept of Feedback
Open-loop and Closed-loop Systems
1.2.9 Discrete-Time Systems
1.3 DISCRETE-EVENT SYSTEMS
1.3.1 The Concept of Event
Time-driven and Event-driven Systems
1.3.2 Characteristic Properties of Discrete-Event Systems
Untimed and Timed Models for Discrete-Event Systems
1.3.3 Examples of Discrete-Event Systems
Queueing Systems
Computer Systems
Communication Systems
Manufacturing Systems
Traffic Systems
1.4 SUMMARY OF SYSTEM CLASSIFICATIONS
1.5 THE GOALS OF SYSTEM THEORY
SUMMARY
CHAPTER 2: Untimed Models of Discrete-Event Systems
2.1 INTRODUCTION
2.2 LANGUAGES AND AUTOMATA THEORY
2.2.1 Language Notation and Definitions
Regular Expressions
2.2.2 Finite-State Automata
State Transition Diagrams
Automata as Language Recognizers
Nondeterministic Finite State Automata
Equivalence of Finite-State Automata and
Regular Expressions
2.2.3 State Aggregation in Automata
2.2.4 Discrete-Event Systems as State Automata
2.2.5 State Automata Models for Queueing Systems
2.2.6 State Automata with Output
2.2.7 Supervisory Control of Discrete-Event Systems
2.3 PETRI NETS
2.3.1 Petri Net Notation and Definitions
2.3.2 Petri Net Markings and State Spaces
2.3.3 Petri Net Dynamics
2.3.4 Petri Net Models for Queueing Systems
2.3.5 Comparison of Petri Net and State Automata Models
2.4 ANALYSIS OF UNTIMED MODELS OF DISCRETE-EVENT SYSTEMS
2.4.1 Problem Classification
Boundedness
Conservation
Liveness and Deadlocks
State Reachability
State Coverability
Persistence
Language Recognition
2.4.2 The Coverability Tree
2.4.3 Applications of the Coverability Tree
Boundedness Problems
Conservation Problems
Coverability Problems
Coverability Tree Limitations
SUMMARY
CHAPTER 3: Timed Models of Discrete-Event Systems
3.1 INTRODUCTION
3.2 TIMED STATE AUTOMATA
3.2.1 The Clock Structure
3.2.2 Event Timing Dynamics
3.2.3 A State Space Model
3.2.4 Queueing Systems as Timed State Automata
3.2.5 The Event Scheduling Scheme
3.3 TIMED PETRI NETS
3.3.1 Timed Petri Net Dynamics
3.3.2 Queueing Systems as Timed Petri Nets
3.4 DIOID ALGEBRAS
3.4.1 Basic Properties of the (max, +) Algebra
3.4.2 Modeling Queueing Systems in the (max, +) Algebra
SUMMARY
CHAPTER 4: Stochastic Timed Models for Discrete-Event Systems
4.1 INTRODUCTION
4.2 DEFINITIONS, NOTATION, AND CLASSIFICATIONS OF STOCHASTIC PROCESSES
4.2.1 Continuous-state and Discrete-state Stochastic Processes
4.2.2 Continuous-time and Discrete-time Stochastic Processes
4.2.3 Some Important Classes of Stochastic Processes
Stationary Processes
Independent Processes
Markov Processes
Semi-Markov Processes
Renewal Processes
4.3 STOCHASTIC CLOCK STRUCTURES
4.4 STOCHASTIC TIMED STATE AUTOMATA
4.5 THE GENERALIZED SEMI-MARKOV PROCESS (GSMP)
4.5.1 Queueing Systems as Generalized Semi-Markov Processes
4.5.2 GSMP Analysis
4.6 THE POISSON COUNTING PROCESS
4.7 PROPERTIES OF THE POISSON PROCESS
4.7.1 Exponentially Distributed Interevent Times
4.7.2 The Memoryless Property
4.7.3 Superposition of Poisson Processes
4.7.4 The Residual Lifetime Paradox
4.8 THE GSMP WITH A POISSON CLOCK STRUCTURE
4.8.1 Distribution of Interevent Times
4.8.2 Distribution of Events
4.8.3 Markov Chains
4.9 EXTENSIONS OF THE GENERALIZED SEMI-MARKOV PROCESS
SUMMARY
CHAPTER 5: Markov Chains
5.1 INTRODUCTION
5.2 DISCRETE-TIME MARKOV CHAINS
5.2.1 Model Specification
5.2.2 Transition Probabilities and the
Chapman-Kolmogorov Equations
5.2.3 Homogeneous Markov Chains
5.2.4 The Transition Probability Matrix
5.2.5 State Holding Times
5.2.6 State Probabilities
5.2.7 Transient Analysis
5.2.8 Classification of States
Null and Positive Recurrent States
Periodic and Aperiodic States
Summary of State Classifications
5.2.9 Steady State Analysis
5.2.10 Irreducible Markov Chains
5.2.11 Reducible Markov Chains
5.3 CONTINOUS-TIME MARKOV CHAINS
5.2.1 Model Specification
5.3.2 Transition Functions
5.3.3 The Transition Rate Matrix
5.3.4 Homogeneous Markov Chains
5.3.5 State Holding Times
5.3.6 Physical Interpretation and Properties of the
Transition Rate Matrix
5.3.7 Transition Probabilities
5.3.8 State Probabilities
5.3.9 Transient Analysis
5.3.10 Steady State Analysis
5.4 BIRTH-DEATH CHAINS
5.4.1 The Pure Birth Chain
5.4.2 The Poisson Process Revisited
5.4.3 Steady State Analysis of Birth-Death Chains
5.5 UNIFORMIZATION OF CONTINUOUS-TIME MARKOV CHAINS
SUMMARY
CHAPTER 6: Introduction to Queueing Theory
6.1 INTRODUCTION
6.2 SPECIFICATION OF QUEUEING MODELS
6.2.1 Stochastic Models for Arrival and Service Processes
6.2.2 Structural Parameters
6.2.3 Operating Policies
6.2.4 The A/B/m/K Notation
6.2.5 Open and Closed Queueing Systems
6.3 PERFORMANCE OF A QUEUEING SYSTEM
6.4 QUEUEING SYSTEM DYNAMICS
6.5 LITTLE'S LAW
6.6 ANALYSIS OF SIMPLE MARKOVIAN QUEUEING SYSTEMS
6.6.1 The M/M/1 Queueing System
6.6.2 The M/M/m Queueing System
6.6.3 The M/M/infinity Queueing System
6.6.4 The M/M/1/K Queueing System
6.6.5 The M/M/m/m Queueing System
6.6.6 The M/M/1//N Queueing System
6.6.7 The M/M/m/K/N Queueing System
6.7 MARKOVIAN QUEUEING NETWORKS
6.7.1 The Departure Process of the M/M/1 Queueing System
6.7.2 Open Queueing Networks
6.7.3 Closed Queueing Networks
Computation of the Normalization Constant C(N)
Mean Value Analysis
6.7.4 Product Form Networks
6.8 NON-MARKOVIAN QUEUEING SYSTEMS
6.8.1 The Method of Stages
6.8.2 Mean Value Analysis of the M/G/1 Queueing System
6.8.3 Software Tools for the Analysis of
General Queueing Networks
SUMMARY
CHAPTER 7: Controlled Markov Chains
7.1 INTRODUCTION
7.2 THE NATURE OF ``CONTROL'' IN MARKOV CHAINS
7.3 MARKOV DECISION PROCESSES
7.3.1 Cost Criteria
7.3.2 Uniformization
7.3.3 The Basic Markov Decision Problem
7.4 SOLVING MARKOV DECISION PROBLEMS
7.4.1 The Basic Idea of Dynamic Programming
7.4.2 Dynamic Programming and the Optimality Equation
Convergence of the Dynamic Programming algorithm
The Optimality Equation
7.4.3 Extensions to Unbounded and Undiscounted Costs
7.4.4 Optimization of the Average Cost Criterion
7.5 CONTROL OF QUEUEING SYSTEMS
7.5.1 The Admission Problem
7.5.2 The Routing Problem
7.5.3 The Scheduling Problem
SUMMARY
CHAPTER 8: Introduction to Discrete-Event Simulation
8.1 INTRODUCTION
8.2 THE EVENT SCHEDULING SIMULATION SCHEME
8.3 THE PROCESS-ORIENTED SIMULATION SCHEME
8.4 DISCRETE-EVENT SIMULATION LANGUAGES
8.5 RANDOM NUMBER GENERATION
8.5.1 The Linear Congruential Technique
8.6 RANDOM VARIATE GENERATION
8.6.1 The Inverse Transform Technique
8.6.2 The Convolution Technique
8.6.3 The Composition Technique
8.6.4 The Acceptance-Rejection Technique
8.7 OUTPUT ANALYSIS
8.7.1 Simulation Characterizations
8.7.2 Parameter Estimation
Point Estimation
Interval Estimation
8.7.3 Output Analysis of Terminating Simulations
8.7.4 Ouput Analysis of Non-terminating Simulations
Replications with Deletions
Batch Means
Regenerative Simulation
SUMMARY
CHAPTER 9: Sensitivity Analysis and Sample Path
Constructability Techniques
9.1 INTRODUCTION
9.2 SAMPLE FUNCTIONS AND THEIR DERIVATIVES
9.2.1 Performance Sensitivities
9.2.2 The Uses of Sensitivity Information
9.3 PERTURBATION ANALYSIS: SOME KEY IDEAS
9.4 PERTURBATION ANALYSIS OF GI/G/1 QUEUEING SYSTEMS
9.4.1 Perturbation Generation
Derivatives of Random Variates
Scale and Location Parameters
Parameters of Discrete Distributions
9.4.2 Perturbation Propagation
Infinitesimal and Finite Perturbation Analysis
9.4.3 Infinitesimal Perturbation Analysis (IPA)
9.4.4 Implementation of IPA for the GI/G/1 System
9.5 IPA FOR STOCHASTIC TIMED AUTOMATA
9.5.1 Event Time Derivatives
9.5.2 Sample Function Derivatives
9.5.3 Performance Measure Derivatives
The Commuting Condition
Continuity of Sample Functions
Unbiasedness of IPA Estimators
Consistency of IPA Estimators
9.5.4 IPA Applications
Sensitivity Analysis of Queueing Networks
Performance Optimization
9.6 THE SENSITIVITY ESTIMATION PROBLEM REVISITED
9.7 EXTENSIONS OF IPA
9.7.1 Discontinuities due to Multiple Customer Classes
9.7.2 Discontinuities due to Routing Decisions
9.7.3 Discontinuities due to Blocking: IPA with
Event Rescheduling
9.8 SMOOTHED PERTURBATION ANALYSIS (SPA)
9.8.1 Systems with Real-Time Constraints
9.8.2 Marking and Phantomizing Techniques
9.9 PERTURBATION ANALYSIS FOR FINITE PARAMETER CHANGES
9.10 SAMPLE PATH CONSTRUCTABILITY TECHNIQUES
9.10.1 The Uses of Constructability: ``Rapid Learning''
9.10.2 Sample Path Constructability Conditions
The Observability Condition
The Constructability Condition
9.10.3 The Standard Cock Approach
9.10.4 Augmented System Analysis
The Event Matching Algorithm
The Age Matching Algorithm
Augmented System Analysis with ``Time Warping''
SUMMARY
Appendix I: A Review fo Probability Theory
Appendix II: Discrete-Event Simulation Using the SIMAN Language
Appendix III: Infinitesimal Perturbation Analysis (IPA) Estimators
_._________________________________________________________________________._
Contributed by: Edwin Chong (echong@ecn.purdue.edu)
Book review announcement:
E. K. P. Chong, ``Review of
Discrete Event Systems: Modeling and Performance Analysis,
by Christos G. Cassandras; Richard D. Irwin, Inc., and
Aksen Associates, Inc., Homewood, IL, 1993., xix + 790 pp.,
ISBN 0-256-11212-6,''
Discrete Event Dynamic Systems: Theory and Applications,
vol.~4, pp.~113--116, 1994.
_._________________________________________________________________________._
Journals
_._________________________________________________________________________._
Contributed by: Edwin Chong (echong@ecn.purdue.edu)
DISCRETE EVENT DYNAMIC SYSTEMS: THEORY AND APPLICATIONS
VOLUME 4
ISSUE 2, May 1994
- On Using Continuous Flow Lines to Model Discrete Production
Lines: Suri & Fu
- Uniformization Based Sensitivity Estimation for a Class of
Discrete-Event Systems: Vakili & Yu
- Diagnosability of Discrete Event Systems and Its Applications:
Lin
ISSUE 1, February 1994
- Supervisory Control Using Augmented Languages in Discrete Event
Systems: Ushio
- Huffman Algebras for Independent Random Variables: Chang & Thomas
- Input/Output Discrete Event Processes and Communication Delays:
Balemi
- Convergence of Stochastic Approximation Coupled with Perturbation
Analysis in a Class of Manufacturing Flow Control Models: Haurie,
L'Ecuyer & van Delft
- Book Review
VOLUME 3
ISSUE 4, September
- Editorial: Ho
- Letter to the Editor: Smedinga
- Rebuttal: Le Style Est l'Homme, and Beyond: Yao
- Sample-Path Analysis of Stochastic Discrete-Event Systems: El-
Taha, & Stidham, Jr.
- Stationary IPA Estimates for Nonsmooth G/G/1/ì Functionals via
Palm Inversion and Level-
Crossing Analysis: Br‚maud & Lasgouttes
- Transient Product Form Distributions in Queueing Netowrks:
Boucherie & Taylor
- Optimal Control of a Class of DEDS: Flow-Shops with State-
Dependent Processing Times: Wagneur & Sriskandarajah
ISSUE 2/3
SPECIAL ISSUE: Guest Editors: Bernard P. Zeigler and William H.
Sanders
- Introduction: Frameworks for Evaluating Discrete-Event Dynamic
Systems: Zeigler/Sanders
- An Environment for DEVS-Based Multi-Formalism Simulation in
Common List/CLOS:
Praehofer/Auering/Reisinger
- A Simulation Environment for MUltimodeling: Fishwick
- DEVS Methodology for Evaluating Time-Constrained Message Routing
Policies: Ahn/Kim
- Extending the DEVS Formalism for Massively Parallel Simulation:
Wang/Zeigler
- Specification Techniques for Markov Reward Models:
Haverkort/Trivedi
- Modeling Discrete Event Systems with State-Dependent
Deterministic Service Times:
Lindermann/German
- Efficient Simulation of Hierarchical Stochastic Activity Network
Models: Sanders/Freire
ISSUE 1, May 1993
- Sensitivity Analysis and Optimization of Stochastic Petri Nets:
Archetti/Gaivoronski/Sciomachen
- A Modeling Strategy for Hybrid Systems Based on Event Structures:
Peleties/DeCarlo
- Recursive Computation of Limited Lookahead Supervisory Controls
for Discrete Event
Systems: Chung/Lafortune/Lin
CONTENTS VOLUME 2
ISSUE 3/4, February 1993
- Protocol Design for an Automated Highway System: Ann Hsu, Farokh
Eskafi, Sonia Sachs,
& Pravin Varaiya
- Tandem Queues with General Blocking: A Unified Model and
Comparison Results: Dinah W.
Cheng & David D. Yao
- Asymptotic Continuous Petri Nets: Jean Le Bail, Hassane Alla &
Rene David
- Locked Discrete Event Systems: How to Model and How to Unlock:
Rein Smedinga
ISSUE 2, November 1992
Optimizing discrete event dynamic systems via the gradient surface
method
Y.C. Ho, Harvard University, L. Shi, and L. Dai
Augmented infinitesimal perturbation analysis: An alternate
explanation
A.A. Gaivoronski, L.Y. Shi and R.S.
Sreenivas
A graph-theoretic optimal control problem for terminating discrete
event
processes
R. Sengupta, University of Michigan, S. Lafortune
ISSUE 1, July 1992
The Brownian approximation for rate-control throttels and the
B/G/1/C queue
A.W. Berger and W. Whitt
Ordinal optimization of DEDS
Y.C. Ho, R.S. Sreenivas, and P. Vakili
CONTENTS VOLUME 1
ISSUE 4, June 1992
Convergence of recursive optimization algorithms using
infinitesimal
perturbation analysis estimates
E.K.P. Chong and P.J. Ramadge
Simulating finitely recursive processes in LISP
R.A. Ceislak and P. Varaiya
Smoothed perturbation analysis for a class of piecewise constant
sample
performance functions
Y. Wardi, W.-B. Gong, C.G. Cassandras, and M.H. Kallmes
Recursive equations and basic properties of timed Petri Nets
F. Baccelli, G. Cohen, and B. Gaujal
ISSUE 3, January 1992
Editorial
Y.C. Ho
Full-state perturbation analysis of discrete event dynamic systems
Z.-Q. Wang, W.-Z. Song, and C.-B. Feng
Event rates and aggregation in hierarchical discrete event systems
K.M. Passino and P.J. Antsaklis
New performance sensitivity formulae for a class of product-form
queueing
networks
X.-R. Cao and D.-J. Ma
Monotonicity properties of cost functions in queueing networks
P.D. Sparaggis and C.G. Cassandras
Contributing authors
ISSUE 2, September 1991
Dynamic setup scheduling and flow control in manufacturing systems
A. Sharifnia, M. Caramanis, and S.B. Gershwin
Eigenvalues of dynamic max-min systems
G.J. Olsder
On condition/event systems with discrete state realizations
R.S. Sreenivas and B.H. Krogh
ISSUE 1, May 1991
Algebraic structure of some stochastic discrete event systems, with
applications
P. Glasserman and D.D. Yao
Strong consistency of infinitesimal perturbation analysis for
tandem
queueing networks
Y. Wardi and J.Q. Hu
On tolerable and desirable behaviors in supervisory control of
discrete
event systems
S. Lafortune and F. Lin
Modeling operator/workstation interference in asynchronous
automatic
assembly systems
M. Kamath and J.L. Sanders
_._________________________________________________________________________._
Conferences
_._________________________________________________________________________._
Contributed by: Christos Cassandras (CASSANDRAS@CCS23.ECS.UMASS.EDU)
Call for Paper (HKIWNDCM'94) 1994 Hong Kong
International Workshop on New Directions of Control and Manufacturing
(Nov. 7-9, 1994, Hong Kong)
Scope
Recent years have seen the rapid development of control and
manufacturing. Many new theoretical and application areas are
emerging. The objectives of this workshop are to provide a forum where
worldwide researchers and practitioners may meet and discuss the new
trends in these fields, as well as to disseminate the new ideas and
technologies in these new fields in Hong Kong, China, and East Asia.
Rapid economic development in Asia in recent years has provided a major
market for applications of these new theories and technologies.
Accepted papers will appear in the workshop proceedings and may be
selected subsequently for inclusion in an archival monograph. General
topics of interest will include but are not limited to
o Discrete event system theory and application (Petri nets, logical
modelling and analysis, automata theory, perturbation analysis)
o System performance evaluation o Control and optimization of computer
and communication networks o Robotics o Robust and optimal control o
Optimization methods o Adaptive control and identification o Production
planning and scheduling problems o Modeling and optimization issues in
manufacturing o New approaches in the areas of control and systems
Key Dates:
July 5, 1994: Submission deadline August 20, 1994:
Notification of decisions October 1, 1994: Submission of
Camera-ready copies November 7-9, 1994: Workshop
Registration fee:
Before October 1 After October 1
Regular HK$2000 HK$2300
Student HK$ 300 (not including banquet) HK$300
Invited Speakers:
Karl J. Astrom, Sweden Han-Fu Chen, China Yu-Chi Ho, U.S.A.
Xin-Song Jiang, China Petar V. Kokotovic, U.S.A. Sanjoy K.
Mitter, U.S.A. Pravin Varaiya, U.S.A. Eugene Wong, U.S.A.
George Zames, Canada
The Organization
Chairman: Dr. Xi-Ren Cao, Co-chairman: Prof. T. J. Tarn
The International Program Committee Chairman: Dr. Wing Shing Wong,
Program coordinators:
North America: Prof. T. J. Tarn China: Dr. Xunyu Zhou
Taiwan/Japan/Southeast Asia: Dr. Houmin Yan Europe/Australia:
Dr. James Lam
Committee members
Prof. J. Baillieul (U.S.A.) Prof. Pierre Bremaud (France) Prof.
C. Cassandras (U.S.A.) Prof. Shi Chung Chang (Taiwan) Prof.
Tsu-Shuan Chang (U.S.A.) Prof. R. Evans (Australia) Prof. Weibo
Gong (U.S.A.) Prof. G. Goodwin (Australia) Prof. L. Guo (China)
Prof. T.C. Hsia (U.S.A.) Prof. Lin Huang (China) Dr. Y. S. Hung
(Hong Kong) Prof. Hidenori Kimura (Japan) Prof. Bruce Krogh
(U.S.A.) Prof. Xunjing Li (China) Dr. Zexiang Li (Hong Kong)
Prof. Peter Luh (U.S.A.) Prof. T. Mita (Japan) Prof. T. S. Ng
(Hong Kong) Prof. M. Tseng (Hong Kong) Prof. K. L. Teo
(Australia) Prof. G. Yin (U.S.A.)
The Organizing Committee:
Robin Bradbeer, X. R. Cao, Peter Cheung, Daniel Ho, James Lam,
Li Qiu,
T. J. Tarn, Lixin Wang, Lam Yeung, Houmin Yan, Xunyu Zhou,
Please submit four papers and send enquiries to
Dr. Lixin Wang Depart. of EEE The Hong Kong Univ. of Sci. & Tech.
Kowloon, Hong Kong Tel: (852) 358-7068, Fax: (852) 358-1485 e-mail:
eewang@uxmail.ust.hk
Sponsored by
The Hong Kong University of Science and Technology The Chinese
University of Hong Kong IEEE Hong Kong Robotics and
Automation/Control Systems Joint Chapter
IEEE Hong Kong Section
Supported by
Chiang Industrial Charity Foundation LTD. K. C. Wong Education
Foundation Lee Hysan Foundation Limited
About Hong Kong:
Hong Kong: An International City. When the West Came East, this is
where it settled and felt most at home. Today Hong Kong offers the
highest standard of services, the sophistication of a cosmopolitan
centre and the exotic feel of the Orient all rolled into one. Hong
Kong, a major international city and the gateway to Asia, surprisingly
accessible from North America and Europe, is located at the hub of
airline operations which bring all of Asia's main cities within a few
hours' flying time.
_._________________________________________________________________________._
Contributed by: Christos Cassandras (CASSANDRAS@CCS23.ECS.UMASS.EDU)
11TH INTERNATIONAL CONFERENCE ON ANALYSIS & OPTIMISATION OF SYSTEMS
Local organizing committee
G. Cohen (Ecole des Mines de Paris & Inria-Rocquencourt, France)( Chairman)
F. Baccelli (INRIA-Sophia & Ecole Polytechnique, France)
G. Fayolle (INRIA-Rocquencourt, France)
V. Malyshev (INRIA-Rocquencourt & Moscou University France)
J.P. Quadrat (INRIA-Rocquencourt & Ecole Polytechnique, France)
Scientific Committee
local organizing committee
and
P. Bremaud (LSS and Ecole Polytechnique, France)
C. Cassandras (University of Massachussetts/Amherst, USA)
S. Gershwin (MIT, USA)
B.H. Krogh (Carnegie-Mellon University, USA)
G.J. Olsder ( Delft University Netherlands)
R. Suri (Universite of Wisconsin-Madison, USA)
J.H. Van Schuppen (CWI,Netherlands )
M. Viot (CNRS and Ecole Polytechnique, France)
W.M. Wonham (University of Toronto, Canada)
Conference secretary
F. Tapissier
DES94
INRIA-Rocquencourt
Bureau des Cours et Colloques
B.P. 105
78153 LE CHESNAY Cedex (France)
Tel. : (33) (1) 39 63 56 00
Fax : (33) (1) 39 63 56 38
email : symposia@inria.fr
The 11th International Conference on Analysis and Optimization of Systems
organized by INRIA-Rocquencourt and Ecole des Mines de Paris will be the
second specialized conference of the series. This time, the specific field
covered will be Discrete Event System (DES). It can be considered also as
the second WODES/CODES conference (series of conferences on Discrete Event
Systems).
This conference is aimed at engineers and mathematicians working in the
field of Automatic Control, Operations Research and Statistics who are
interested by the modeling, analysis and optimization of Discrete Event
Systems. Many formalisms have been developed to describe such systems. The
comparison of the different mathematical approaches and their global
confrontation with the applications are the main goals of the conference.
The format of the conference will offer a certain number of "key" sessions
on the principal mathematical approaches and some important fields of
application. Each session will be divided into two parts. The first
tutorial part will be made of a plenary session the morning and of invited
more specialized talks giving some complements on specific points discussed
briefly in the plenary sessions. These contributions will be presented at
the beginning of each afternoon. The second part will be composed of the
contributed papers in which recent and original results will be presented.
The latter talks will be scheduled at the end of each afternoon. Three
sessions will be programmed in parallel each afternoon.
INFORMATION
This programme and last minute information are available on the
following ftp servers:
- ftp.inria.fr, directory: INRIA/Projects/Meta2/confs/DES/news
- ftp.ensmp.fr, directory: pub/conf-DES/news
___________________________________________________________
WELCOME
Tuesday June 14, 1994
16H00 -18H30 Welcome, registration
Wednesday June 15, 1994
8H00-9H00 Welcome, registration
9H00-9H15 Opening address
19H30 Reception
___________________________________________________________________
PLENARY SESSIONS
Wednesday Morning
-----------------
--- The Petri Net Approach ---
9H15-10H00: Analysis of Autonomous Petri Nets with Bulk Services and
Arrivals
M. Silva, E. Teruel (Universita de Zaragoza, Spain)
--- The Automata Theoretic Approach ---
10H15-11H15: Logical Aspects of Control of DES: A Survey of Tools and
Techniques
J. G. Thistle (Ecole Polytechnique de Montreal, Canada)
--- Simulation and Perturbation Analysis ---
11H30-12H30: Sample-Path-Based Continuous and Discrete Optimization of DES
C. G. Cassandras (University of Massachusetts, Amherst, USA)
Thursday Morning
----------------
--- The Petri Net Approach ---
9H00-10H00: Dependability and Performability Analysis Using Stochastic Petri
Nets
K. Trivedi, S. Garg (Duke University, Durham, USA), G. Ciardo
(College of William and Mary, Williamsburg, USA), M. Malhotra
(ATT-Bell Lab., Holmdel, USA)
--- The Max-Plus Algebraic Approach ---
10H15-11H15: Dioids and Discrete Event Systems
G. Cohen (Ecole des Mines, Fontainebleau, France)
--- Hybrid Systems ---
11H30-12H30: On Hybrid Systems: a Computer Science Framework
J. Sifakis (VERIMAG, Grenoble, France)
Friday Morning
--------------
--- Manufacturing Systems ---
9H00-10H00: Management of Manufacturing Systems Based on Petri Nets
J.-M. Proth (INRIA Lorraine, Metz, France)
--- Network Stability ---
10H15-11H15: A Survey of Markovian Methods for Stability of Networks
D. Down, S. Meyn (University of Illinois, Urbana, USA)
--- Large DES ---
11H30-12H30: Probabilistic Aspects of Large DES
V. Malyshev (INRIA Rocquencourt, France)
_______________________________________________________________
Wednesday Afternoon 1
---------------------
--- The Automata Theoretic Approach ---
+++ Invited presentations +++
14H30-15H00: Automata-Theoretic Verification of Coordinating Processes
R. P. Kurshan (ATT Bell Lab., Murray Hill, USA)
15H00-15H30: Hierarchical COCOLOG for Finite Machines
Y.J. Wei, P.E. Caines (McGill University, Montreal, Canada)
15H30-16H00: Nondeterministic Supervision under Partial Observations
K. Inan (Middle East Technical University, Ankara, Turkey)
16H00-16H30: Break
+++ Contributed papers +++
16H30-16H50: Avoiding Blocking in Prioritized Synchronization Based Control
of Nondeterministic Systems
R. Kumar (University of Kentucky, Lexington, USA),
M. A. Shayman (University of Maryland, College Park, USA)
16H50-17H10: Supervisory Control for Nondeterministic Systems
A. Overkamp (CWI, Amsterdam, The Netherlands)
17H10-17H30: Effective Control of Logical DES in a Trace Theory Setting
Using the Reflection Operator
R. Smedinga (University of Groningen, The Netherlands)
17H30-17H50: Break
17H50-18H10: Diagnosability of Discrete Event Systems
M. Sampath, R. Sengupta, S. Lafortune , D. Teneketzis (University
of Michigan, Ann Arbor, USA), K. Sinnamohideen (USA)
18H10-18H30: On the supremal Lm-closed / or L-controllable Sublanguage of a
Given Language
R. M. Ziller, J. E.R. Cury (Universidade Federal de Santa Catarina,
Florianopolis, Brazil)
__________________________________________________________________________
Wednesday Afternoon 2
---------------------
--- Manufacturing Systems ---
+++ Contributed papers +++
14H30-14H50: Approximate Closed Queuing Network Model of a Manufacturing
Cell
S. Y. Ruan, M.A. Jafari (Rutgers University, Piscataway, USA)
14H50-15H10: Optimizing the Transient Behavior of Hedging Control Policies
in Manufacturing Systems
S. El-Ferik, R.P. Malhame (Ecole Polytechnique de Montreal, Quebec,
Canada)
15H10-15H30: Finding Optimal Number of Kanbans in a Manufacturing System via
Perturbation Analysis
H. Yan, X.Y. Zhou (Chinese University, Shatin, Hong Kong), G. Yin
(Wayne State University, Detroit, USA)
15H30-15H50: Performance Evaluation of a Generalized Kanban System
M. Di Mascolo (LAG-ENSIEG, St Martin d'Heres, France)
15H50-16H00: Questions
16H00-16H30: Break
16H30-16H50: Hoist Scheduling Problem in a Real Time Context
J. Lamothe , M. Correge, J. Delmas (CERT, Toulouse, France)
16H50-17H10: On Controlling a Class of Assembly System with Alternative
Production Routing
J.-M. Proth, L. Wang, L. X. Xie (INRIA Lorraine, Metz, France)
17H10-17H30: Planification Hierarchisee de la Production : Agregation du
Temps et Coherence
G. Fontan, G. Hetreux, C. Merce (LAAS du CNRS, Toulouse, France)
17H30-17h50: Break
17H50-18H10: Multi-Site Planning: a Centralized or a Distributed Approach?
C. Thierry, P. Le Page, N. Chapeaublanc, G. Bel (CERT, Toulouse,
France)
18H10-18H30: Algorithms for Simultaneous Scheduling of Machines and Vehicles
in a FMS
T. Sawik (University of Mining & Metallurgy, Cracow, Poland)
_________________________________________________________________________
Wednesday Afternoon 3
---------------------
--- Simulation and Perturbation Analysis ---
+++ Invited presentations +++
14H30-15H00: Infinitesimal Perturbation Analysis of Generalized Semi-Markov
Processes
X-R. Cao (The Hong Kong University of Science & Technology)
15H00-15H30: A Tutorial Overview of Optimization via Discrete Event
Simulation
M. Fu (University of Maryland, College Park, USA)
15H30-16H00: Parallel Simulation of Discrete Event Systems
R.M. Fujimoto (Georgia Institute of Technology, Atlanta, USA)
16H00-16H30: Break
+++ Contributed papers +++
16H30-16H50: Estimation of Performance Measure Derivatives for Stochastic
Recursions
P.W. Glynn (Stanford University, USA), P. L'Ecuyer (University
of Montreal, Canada)
16H50-17H10: Perturbation Analysis for the GI / G / 1 Queue with Two
Priority Classes
N. Miyoshi, T. Hasegawa (Kyoto University, Japan)
17H10-17H30: Supply Management in Assembly Systems: the Case of Random Lead
Times
C. Chu, J.-M. Proth, X. Xie (INRIA Lorraine, Metz, France),
Y. Wardi (Georgia Institute of Technology, Atlanta, USA)
17H30-17H50: Break
17H50-18H10: Simulation Trees for Functional Estimation via the Phantom
Method
F. Vazquez-Abad, P. L'Ecuyer (University of Montreal, Canada)
18H10-18H30: Infinitesimal Perturbation Analysis for DES with Discrete
Lifetime Distributions
B. Heidergott (University of Hamburg, Germany)
___________________________________________________________________________
Thursday Afternoon 1
--------------------
--- Hybrid Systems ---
+++ Invited presentations +++
14H30-15H00: Automatic Symbolic Verification of Embedded Systems
R. Alur (ATT, Murray Hill, USA)
15H00-15H30: From Timed Graphs to Hybrid Automata
C. Courcoubetis (Institute of Computer Science, Heraklion, Greece)
15H30-16H00: A Unified Framework for Hybrid Control
M.S. Branicky, S. Mitter (MIT, Cambridge, USA), V.S. Borkar
(Indian Institute of Science, Bangalore, India)
16H00-16h30: Break
16H30-17H00: Reasoning About Hybrid Systems with Symbolic Simulation
S. Narain (Bellcore, Morristown, USA)
+++ Contributed papers +++
17H00-17H20: Simple Hybrid Control Systems - Continuous FDLTI Plants
J. Raisch (University of Toronto, Canada)
17H20-17H40: Controllability and Control-Law Synthesis of Linear Hybrid
Systems
M. Tittus, B. Egardt (Chalmers University of Technology,
Gothenburg,
Sweden)
Approche par l'Algebre Max-Plus /
__________________________________________________________________________
Thursday Afternoon 2
--------------------
--- The Max-Plus Algebraic Approach ---
+++ Invited presentations +++
14H30-15H00: On Structural Properties of Min-Max Systems
G.J. Olsder (Delft University of Technology, The Netherlands)
15H00-15H30: Rational Series over Dioids and DES
S. Gaubert (INRIA Rocquencourt, France)
15H30-16H00: Stochastic Linear Systems in the Max-Plus Algebra
J. Mairesse (INRIA Sophia-Antipolis, France)
16H00-16H30: Break
+++ Contributed papers +++
16H30-16H50: Cycle Times and Fixed Points of Min-Max Functions
J. Gunawardena (Stanford University, USA)
16H50-17H10: Characteristic Equation & Minimal Realization of SISO Systems
in Max Algebra
B. De Schutter, B. De Moor (KU Leuven, Belgium)
17H10-17H30: Max-Algebra Solution to the Supervisory Control Problem for
Real-Time DES
D.D. Cofer, V. Garg (University of Texas, Austin, USA)
17H30-17H50: Stable Earliest Starting Schedules for Periodic Job Shops: a
Linear Approach
T.-E. Lee (KAIST, Taejon, Korea)
___________________________________________________________________________
Thursday Afternoon 3
--------------------
--- The Petri Net Approach ---
+++ Invited presentation +++
14H30-15H00: Controlled Petri Nets: A Tutorial Survey
L. Holloway (University of Kentucky, Lexington, USA),
B.H. Krogh (Carnegie Mellon University, Pittsburgh, USA)
+++ Contributed papers +++
15H00-15H20: Functional and Performance Analysis of Cooperating Sequential
Processes
E. Teruel, M. Silva, J.M. Colom, J. Campos (Universita de Zaragoza,
Spain)
15H20-15H40: Hierarchically Combined Queueing Petri Nets
F. Bause, P. Buchholz, P. Kemper (Universitat Dortmund, Germany)
15H40-16H00: Optimizing Structural Analysis of Extented Petri Nets Models
L. Ferrarini, M. Trioni (Politecnico di Milano, Italy)
16H00-16H30: Break
16H30-16H50: Reduced State Space Generation of Concurrent Systems Using Weak
Persistency
K. Hiraishi (JAIST, Ishikawa, Japan)
16H50-17H10: A New Approach to Discrete Time Stochastic Petri Nets
R. Zijal, R. German (Universitat Berlin, Germany)
17H10-17H30: Analysis of Timed Place/Transition Nets Using Minimal State
Graphs
H-M. Hanisch (Universitat Magdeburg, Germany)
17H30-17H50: An Algebraic Description of Processes of Timed Petri Nets
J. Winkowski (Inst. Podstaw Informatyki, Warszawa, Poland)
__________________________________________________________________________
Friday Afternoon 1
------------------
--- The Automata Theoretic Approach ---
+++ Contributed papers +++
14H30-14H50: Continuous-Time Supervisory Synthesis for Distributed-Clock DES
S.D. O'Young (University of Toronto, Canada)
14H50-15H10: Conditions for Optimization of DES Using Temporal Logic Models
D. Ionescu (University of Ottawa, Canada)
15H10-15H30: Partial Difference Equation Extensions to Automata Regulator
Theory
Q. Yuan, A.D. Baker (University of Cincinnati, USA)
15H30-16H00: Break
16H00-16H20: An Algebraic Temporal Logic Approach to the Forbidden State
Problem in DE Control
K.T. Seow, R. Devanathan (Nanyang Technological University,
Singapore)
16H20-16H40: Automata Timing Specification
D. Delfieu, A.E.K Sahraoui (LAAS du CNRS, Toulouse, France)
16H40-17H00: Synthesis of Static Controllers Using Boolean Differential
Calculus
S. Kowalewski (Universitat Dortmund, Germany)
17H00: End of the conference
___________________________________________________________________________
Friday Afternoon 2
------------------
--- Large DES & Network Stability ---
+++ Invited presentations +++
14H30-15H00: New Probabilistic Models for Computer Architectures
G. Fayolle, V. Malyshev (INRIA Rocquencourt, France), A.V. Filin
15H00-15H30: Stationary Regime and Stability of Free-Choice Petri Nets
F. Baccelli, B. Gaujal (INRIA Sophia-Antipolis, France)
15H30-16H00: Break
+++ Contributed papers +++
16H00-16H20: Allocation Sequences of two Processes Sharing a Ressource
B. Gaujal (INRIA Sophia-Antipolis, France)
16H20-16H40: Stability Criteria for yet Another Class of Multidimensional
Distributed Systems
L. Georgiadis (IBM T.J. Watson Research Center, Yorktown Heights,
USA), W. Szpankowski (Purdue University, Lafayette, USA)
16H40-17H00: Flow Control of a Virtual Circuit
A.K. Agrawala, D. Sanghi, L. Shi (University of Maryland, College
Park, USA)
17H00-17H20: Stochastic Scheduling of Precedence Graphs
L. Finta, Z. Liu (INRIA Sophia-Antipolis, France)
17H20: End of the conference
__________________________________________________________________________
Friday Afternoon 3
------------------
--- The Max-Plus Algebraic Approach ---
+++ Invited presentations +++
14H30-15H00: Time Discrete & Continuous Control Problems Convergence of
Value Functions
S.N. Samborski (Universite de Caen, France)
15H00-15H30: Bellman Processes
M. Akian, J.-P. Quadrat (INRIA Rocquencourt, France), M. Viot
(Ecole Polytechnique, Palaiseau, France)
15H30-16H00: Break
+++ Contributed papers +++
16H00-16H20: Maslov Optimization Theory: Stochastic Interpretation, Particle
Resolution
P. Del Moral, J.-C. Noyer, G. Salut (LAAS du CNRS, Toulouse,
France)
16H20-16H40: Network Methods for Endomorphisms of Semimodules Over Min-Plus
Algebras
P. Dudnikov (Ukraine), S. Samborski (Universite de Caen, France)
16H40-17H00: Subdirect Sum Decomposition of Finite Dimensional Pseudomodules
E. Wagneur (Ecole des Mines de Nantes, France)
17H00: End of the conference
__________________________________________________________________________
LOCATION OF THE CONFERENCE
Ecole des Mines
Rue Claude Daunesse
Sophia-Antipolis - Les Lucioles
F-06565 VALBONNE Cedex
Tel: (33) 93 95 75 40
Fax: (33) 93 65 43 04
*****************************************************************
You can add that further info. can be obtained from
cohen@cas.ensmp.fr
_._________________________________________________________________________._
The End
_._________________________________________________________________________._
Mon Apr 25 14:32:08 1994