DEVS Formalism for Modeling of Discrete-Event Systems 6-3
link layer, a computer system viewed at or above the operating system level, a military war game at the
operation level, and others.
Rest of this chapter is organized as follows. Section 6.2 presents DES modeling in the system-theoretic
view and Section 6.3 introduces the DEVS formalism. Analysis and simulation of DES with DEVS models
are given in Sections 6.4 and 6.5, respectively. Section 6.6 concludes this chapter.
6.2 System-Theoretic DES Modeling
The system-theoretic approach for systems modeling views a system as an object in which its representation
and associated operations are explicitly defined. In the view a system is represented by three sets: inputs
set, outputs set, and states set; operations on the sets are defined as a collection of rules, or functions, for
state transition and output generation.
In DES, both inputs and outputs are finite event sets. However, a states set is not finite. To be precise
recall the definition of state at t in system theory: information required at t which uniquely determines
output at t
> t. In fact, an output in DES is generated at a specified time when a certain condition is
satisfied. Thus, a state at t is represented by a discrete state, s, and an associated elapsed time, e, which is
a real number. Of course, the maximum elapsed time for each discrete state is predefined, which we call
the maximum sojourn time, r, from now on. Then, a state (s,e) means that the discrete state s has been
kept for the e time unit without any external input. If no input is arrived at the state before the maximum
sojourn time r an output would be generated. Of course, an input event can be arrived anytime before
the r time unit. In such a case, the discrete state s is changed to a new one s
that has its own maximum
sojourn time r
. To be clear we call s a discrete state and q =(s,e) a total state or just a state of DES. Since e
is a real number q is not finite.
We are now ready to explain how system theory defines state transition functions of a dynamic system.
In the theory, two state transitions are considered: one with an input and the other without an input. For
example, a well-known vector differential equation for state transition of a linear continuous system is
dQ/dt =AQ + BX,whereQ is a state set, X an inputs vector, and A and B are the coefficient matrices.
Note that dQ/dt =AQ specifies state transition without inputs and dQ/dt =BX specifies that with inputs
X. As will be shown later, the same view would be applied in DES modeling. More specifically DES has a
state transition either with an external input event or with a condition internal to a system, which causes
an internal event. Such a condition at a state q =(s,e) includes e =r, meaning that an elapsed time e is
reached to the maximum sojourn time r at s. From now on we call state transition with an input as external
state transition and that without an input as internal state transition. Similarly, an output is a function of
both an input and a state. However, an output function can be represented only by state information, for
the information memorizes history of inputs information.
As shown in Figure 6.1, a DES consists of components that are connected together for interaction with
events exchange. Thus, specification of DES should have a means to specify the connection. In sum,
modeling of DES in the system-theoretic approach requires the following expression:
•
each component needs inputs set, outputs set, states set, state transition functions, both external
and internal transitions, and output function;
•
connection of components needs a means for coupling between events associated with components.
The DEVS formalism to be introduced in the following chapter supports such an expression in a formal
manner for modeling of DES.
6.3 DEVS Formalism for DES Modeling
The DEVS formalism, developed by Zeigler, specifies a DES with the following three major features
(Zeigler, 1984; Zeigler et al., 2000):
•
set theory-based formalism