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 history of literature—take the net result of Tiraboshi, Warton, or Schlegel,—is a sum of a very few ideas, and of very few original tales,—all the rest being variation of these.”
—Ralph Waldo Emerson (1803–1882)
“Indeed, the Englishman’s history of New England commences only when it ceases to be New France.”
—Henry David Thoreau (1817–1862)
“My good friends, this is the second time in our history that there has come back from Germany to Downing Street peace with honour. I believe it is peace for our time. We thank you from the bottom of our hearts. And now I recommend you to go home and sleep quietly in your beds.”
—Neville Chamberlain (1869–1940)