Computer Science ›› 2007, Vol. 34 ›› Issue (3): 246-249.

Previous Articles     Next Articles

  

  • Online:2018-11-16 Published:2018-11-16

Abstract: A new method to find S-invariant for a net is presented in this paper. The basic idea of this method is to regard a net as a directed graph. By searching for S-closured basic directed transfixion path clusters or S-closured basic directed circuit clusters

Key words: S-invariant, S-closured basic directed circuit cluster, S-closured basic directed transfixion path cluster, Closure repetitive degree

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!