Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/TASE.2009.2021352 | IEEE T. Automation Science and Engineering |
Keywords | Field | DocType |
Discrete event systems,Moon,Safety,Joining processes,XML,State-space methods,Tree graphs,Open systems,System recovery | Discrete mathematics,Strength of a graph,Line graph,Graph property,Computer science,Directed graph,Null graph,Butterfly graph,Voltage graph,Complement graph | Journal |
Volume | Issue | ISSN |
6 | 3 | 1545-5955 |
Citations | PageRank | References |
22 | 1.18 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Moon Ho Hwang | 1 | 40 | 4.77 |
| B. Zeigler | 2 | 1035 | 188.72 |