On the Synthesis Problems of the Semimodular State Chart Theory. II. Semimodular Chart
Author(s) -
Tsuyoshi Nakamura
Publication year - 1980
Publication title -
publications of the research institute for mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.786
H-Index - 39
eISSN - 1663-4926
pISSN - 0034-5318
DOI - 10.2977/prims/1195186934
Subject(s) - combinatorics , mathematics , lemma (botany) , integer (computer science) , state (computer science) , conjecture , algorithm , computer science , ecology , poaceae , biology , programming language
In the preceding paper [1], we studied in detail the grounds of the distributive charts in the spaces spanned by cycles and developed a simple synthesis procedure. However the procedure can not be applied to the synthesis of semimodular charts. One of the difficulties with semimodular charts was that we failed to find a theorem which corresponds to Lemma 2.8 in [1]. The present paper undertakes the synthesis procedure for the semimodular state charts. Although a synthesis procedure for semimodular charts was first given in [2], it is indirect and impractical. Thus the purpose of this paper is to give a direct and clear one for semimodular charts. To help the explanation about the sequence of steps of the procedures, simple state charts are synthesized with figurative expressions for some intermediate steps.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom