Reachability Graph of Finite and Deterministic DEVS Networks


This paper shows how to generate a finite-vertex graph, called a reachability graph for discrete-event system specification (DEVS) network. The reachability graph is isomorphic to a given original DEVS network in terms of behavior but the number of vertices as well as the number of edges of the reachability graph are finite. 
DOI: 10.1109/TASE.2009.2021352


8 Figures and Tables


Citations per Year

Citation Velocity: 13

Averaging 13 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.