We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 1 Issue 4
October  1986
Turn off MathJax
Article Contents
Abstract
References
Related Articles
Xu Xiaoshu. Simplification of Multivalued Sequential SULM Network by Using Cascade Decomposition[J]. Journal of Computer Science and Technology, 1986, 1(4): 84-95.
Citation: Xu Xiaoshu. Simplification of Multivalued Sequential SULM Network by Using Cascade Decomposition[J]. Journal of Computer Science and Technology, 1986, 1(4): 84-95.
shu

Simplification of Multivalued Sequential SULM Network by Using Cascade Decomposition

  • Changsha Railway Institute;

More Information
  • Published Date: October 09, 1986
    Abstract
  • An efficient method for simplifying a multivalued SULM network is presented in this aper.This method employs a cascade decomposition on a multivalued sequential machine M. At first we decompose M into two simpler machines M/π and M′.Instead of the traditional normal tree type network,a simpler SULM network that can realize M can be constructed by cascading M/π and M′.
    • FullText(HTML)
    • References (5)
  • [1]
    T.Arnoid, C.Tan and M.Newborn, Iterratively realized sequential circuits, IEEE Trans. Comput., C-19: 1(1970),54-66.
    [2]
    A.Singh, F.Gray and J.Armstrong, Tree structured sequential multiple-valued logic design from universal modules,IEEE Trans. Comput., C-30: 10(1980), 671-674.
    [3]
    Xu Xiaoshu, The theory and synthesis of multiple-valued logic sequential networks based on T-ULM, Journal of Changsha Railway Institute, 1(1985), 35-46 (in Chinese).
    [4]
    A.E.Almaini, Sequential machine implementations using universal logic modules, IEEE Trans. Comput., C-27:9 (1978), 951-960.
    [5]
    H.A.Thompson and F.G.Gray, Universal modular tree:a design procedure, IEEE Trans. Comput., C-27: 1(1978),53-63 ……….
    • Relative Articles

  • Related Articles

    [1]Riadh Robbana. Verification of Duration Systems Using an Approximation Approach[J]. Journal of Computer Science and Technology, 2003, 18(2).
    [2]LI Yong, Dang Van Hung. Checking Temporal Duration Properties of Timed Automata[J]. Journal of Computer Science and Technology, 2002, 17(6).
    [3]LI Xuandong, TAN Wenkai, ZHENG Guoliang. Checking MSC Specifications for Timing Inconsistency[J]. Journal of Computer Science and Technology, 2002, 17(1).
    [4]LI Li. Towards a Denotational Semantics of Timed RSL Using Duration Calculus[J]. Journal of Computer Science and Technology, 2001, 16(1).
    [5]LI Xuandong. Verifying Time Petri Nets by Linear Programming[J]. Journal of Computer Science and Technology, 2001, 16(1).
    [6]ZHAO Jianhua. Checking Timed Automata for Linear Duration Properties[J]. Journal of Computer Science and Technology, 2000, 15(5): 423-429.
    [7]ZHAO Jianhua, Dang Van Hung. Checking Timed Automata for Linear Duration Properties[J]. Journal of Computer Science and Technology, 2000, 15(5).
    [8]Luo Tiegeng, Chen Huowang, Wang Bingshan, Wang Ji, Gong Zhenghu, Qi Zhichang. Verifying Automata Specification of Distributed Probabilistic Real-Time Systems[J]. Journal of Computer Science and Technology, 1998, 13(6): 588-596.
    [9]Yu Huiqun, Song Guoxin, Sun Yongqiang. Completeness of the Accumulation Calculus[J]. Journal of Computer Science and Technology, 1998, 13(1): 25-31.
    [10]Li Weihua, Yuan Youguang. Error Recovery in a Real-Time Multiprocessor System[J]. Journal of Computer Science and Technology, 1992, 7(1): 83-87.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (37) PDF downloads (1180) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return