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:
“Spain is an overflow of sombreness ... a strong and threatening tide of history meets you at the frontier.”
—Wyndham Lewis (18821957)
“It may be well to remember that the highest level of moral aspiration recorded in history was reached by a few ancient JewsMicah, Isaiah, and the restwho took no count whatever of what might not happen to them after death. It is not obvious to me why the same point should not by and by be reached by the Gentiles.”
—Thomas Henry Huxley (182595)
“It is true that this man was nothing but an elemental force in motion, directed and rendered more effective by extreme cunning and by a relentless tactical clairvoyance .... Hitler was history in its purest form.”
—Albert Camus (19131960)