On Automatic Generation of a Control Sequence on Discrete Event Systems

离散事件系统控制序列的自动生成

• 批准号: 03650342
• 负责人: MATSUMOTO Tadashi
• 金额: $ 1.28万
• 依托单位: Fukui University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for General Scientific Research (C)
• 财政年份: 1991
• 资助国家: 日本
• 起止时间: 1991 至 1992
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-03650342/
• 关键词: Petri net; Discrete Event System; Sequence Control; Firing Sequence; Scheduling; CIM; Deadlock; Trap; シ-ケンス制御; スケジュ-リング

In 1991, in order to achieve" Automatic Generation of a Control Sequence on Discrete Event Systems", we have studied as follows. (1)We derive the necessary and sufficient condition for reachability by using a sequence graph, which is formed of the state equation of a Petri net. (2)We derive a derivation method for linear independent solutions of the state equation of a Petri net. (3)We derive a algorithm for an automatic generation of a control sequence by using the above results (1) and (2).Next, we have constructed an imitative manufacture system for verification of usefulness of our results.In 1992, we have studied as follows after due consideration of our results in 1991. (4)We have programmed the algorithm of the above (3) on an UNIX workstation and we have checked that this program generates a control sequence. (5)We have programmed the other algorithms for analysis of Petri nets in order to be able to analyze a discrete event system.As the results mentioned above, we have achieved the objectives such as (a) derivation of a algorithm for an automatic generation of a control sequence, (b)construction and control of an imitative manufacture system, (c)programming and verification of the derived algorithms.

1991年，为了实现“离散事件系统上控制序列的自动生成”，我们进行了如下研究。 (1)利用由Petri网的状态方程构成的序列图导出了可达性的充要条件。 (2)推导了Petri网状态方程线性独立解的推导方法。 (3)我们利用上述结果(1)和(2)导出了自动生成控制序列的算法。接下来，我们构建了一个模拟制造系统来验证我们结果的有用性。在充分考虑1991年的结果后，我们于1992年进行了如下研究。 (4)我们在UNIX工作站上编写了上述(3)的算法，并检查了该程序生成了 控制序列。 (5)我们编写了Petri网分析的其他算法，以便能够分析离散事件系统。正如上面提到的结果，我们已经实现了以下目标：(a)自动生成控制序列的算法的推导，(b)仿制造系统的构建和控制，(c)推导算法的编程和验证。

项目成果

Tadashi MATSUMOTO: "A useful necessary condition and a simple sufficient condition for liveness of general Petri nets" Transactions of the IEICE of Japan. E74. 3124-3132 (1991)

Tadashi MATSUMOTO：“一般 Petri 网活性的一个有用的必要条件和一个简单的充分条件”日本 IEICE 的交易。

Tadashi MATSUMOTO: "An equivalence net-condition between place-liveness and transition-liveness and its initial-marking-based necesssay and syfficient liveness condition of Petri nets" IEEE International Symposium on Circuits and Systems. 1737-1740 (1992)

Tadashi MATSUMOTO：“地点活跃性和过渡活跃性之间的等价网络条件及其基于初始标记的必要性和 Petri 网的充分活跃性条件”IEEE 国际电路与系统研讨会。

Tadashi MATSUMOTO: "The necesssary and sufficient cobdition for liveness of some timed Petri nets as well as Petri nets without time" IEEEE International Symposium on Circuits and Systems. 2842-2845 (1991)

Tadashi MATSUMOTO：“某些定时 Petri 网以及无时间 Petri 网的活性的必要和充分条件”IEEEE 国际电路与系统研讨会。

Kohkichi TSUJI: "Structures for a homogeneous solution of the state equation of a Special timed Petri net their applications" IEEE International Symposium on Circuits Systems. 834-837 (1991)

Kohkichi TSUJI：“特殊定时 Petri 网状态方程齐次解的结构及其应用”IEEE 国际电路系统研讨会。

Kohkichi TSUJI: "Initial-marking-based liveness conditions of subclasses of general Petri nets" Joint Technical Conference on Circuits/Systems,Computers and Commu-nications. 510-515 (1991)

Kohkichi TSUJI：“一般 Petri 网子类的基于初始标记的活跃条件”电路/系统、计算机和通信联合技术会议。