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:
“The only thing worse than a liar is a liar that’s also a hypocrite!
There are only two great currents in the history of mankind: the baseness which makes conservatives and the envy which makes revolutionaries.”
—Edmond De Goncourt (1822–1896)
“Most events recorded in history are more remarkable than important, like eclipses of the sun and moon, by which all are attracted, but whose effects no one takes the trouble to calculate.”
—Henry David Thoreau (1817–1862)
“Every literary critic believes he will outwit history and have the last word.”
—Mason Cooley (b. 1927)