History
SP-DEVS has been designed to support verification analysis of its networks by guaranting to obtain a finite-vertex reachability graph of the original networks, which had been an open problem of DEVS formalism for roughly 30 years. To get such a reachability graph of its networks, SP-DEVS has been imposed the three restrictions:
- finiteness of event sets and state set,
- the lifespan of a state can be scheduled by a rational number or infinity, and
- preserving the internal schedule from any external events.
Thus, SP-DEVS is a sub-class of both DEVS and FD-DEVS. These three restrictions lead that SP-DEVS class is closed under coupling even though the number of states are finite. This property enables a finite-vertex graph-based verification for some qualitative properties and quantitative property, even with SP-DEVS coupled models.
Read more about this topic: SP-DEVS
Famous quotes containing the word history:
“Social history might be defined negatively as the history of a people with the politics left out.”
—G.M. (George Macaulay)
“A people without history
Is not redeemed from time, for history is a pattern
Of timeless moments.”
—T.S. (Thomas Stearns)
“The history of all previous societies has been the history of class struggles.”
—Karl Marx (1818–1883)