History
FD-DEVS was originally named as ``Schedule-Controlable DEVS`` and designed to support verification analysis of its networks which had been an open problem of DEVS formalism for 30 years. In addition, it was also designated to resolve the so-called ``OPNA`` problem of SP-DEVS. From the viewpoint of Classic DEVS, FD-DEVS has three restrictions
- finiteness of event sets and state set,
- the lifespan of a state can be scheduled by a rational number or infinity, and
- the internal schedule can be either preserved or updated by an input event.
The third restriction can be also seen as a relaxation from SP-DEVS where the schedule is always preserved by any input events. Due to this relaxation there is no longer OPNA problem, but there is also one limitation that a time-line abstraction which can be used for abstracting elapsed times of SP-DEVS networks is no longer useful for FD-DEVS network . But another time abstraction method which was invented by Prof. D. Dill can be applicable to obtain a finite-vertex reachability graph for FD-DEVS networks.
Read more about this topic: Finite & Deterministic Discrete Event System Specification
Famous quotes containing the word history:
“Let it suffice that in the light of these two facts, namely, that the mind is One, and that nature is its correlative, history is to be read and written.”
—Ralph Waldo Emerson (1803–1882)
“All history attests that man has subjected woman to his will, used her as a means to promote his selfish gratification, to minister to his sensual pleasures, to be instrumental in promoting his comfort; but never has he desired to elevate her to that rank she was created to fill. He has done all he could to debase and enslave her mind; and now he looks triumphantly on the ruin he has wrought, and say, the being he has thus deeply injured is his inferior.”
—Sarah M. Grimke (1792–1873)
“The history of the world is none other than the progress of the consciousness of freedom.”
—Georg Wilhelm Friedrich Hegel (1770–1831)