摘要: This paper presents a new method, algorithms and tool for the visualization of a finite complete prefix of a Petri net or a signal transition graph. A transformation is defined that converts such a prefix into a two-level model. A... 展开 This paper presents a new method, algorithms and tool for the visualization of a finite complete prefix of a Petri net or a signal transition graph. A transformation is defined that converts such a prefix into a two-level model. At the top level, it has a finite state machine, describing modes of operation and transitions between them. At the low level, there are marked graphs, which can be drawn as waveforms, embedded into the top level nodes. The models of both levels are abstractions traditionally used by electronics engineers. The resultant model is completed trace equivalent to the original prefix. Moreover, the branching structure of the latter is preserved as much as possible. 收起