Qualitative Analysis of Periodic Schedules for Deterministically Timed Petri Net Systems (Special Section on Discrete Mathematics and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
Periodic schedules are seldom treated in the theory but abound in practice (air flight schedule, train schedule, manufacturing schedule, etc). This paper introduces a Petri Net based perspective to periodic schedules. These are classified, according to the time interpretation into single-server and multiple-server semantics and, according to transitions firing periodicity constraints, into strict and general periodic schedules. Using a net transformation rule, the computation of the general schedule class can be done through techniques for the strict subclass. Introducing truncation error terms ε for the floor functions, a necessary and sufficient condition for the feasibility of a strict periodic schedule is given in terms of a large size system of nonlinear inequalities containing ε terms. Moreover averaging this condition on subperiods allows to get a small size linear system of inequalities as necessary conditions for speeding up iterative computation processes. This paper aims to present qualitative analysis of periodic schedules for deterministically timed Petri net systems, as a precursor to quantitative analysis that requires large-scale computational experiments and hence will be dealt in later work.
- 社団法人電子情報通信学会の論文
- 1993-04-25
著者
-
Watanabe Toshimasa
The Faculty Of Engineering Hiroshima University
-
Onaga Kenji
The Faculty Of Engineering Hiroshima University
-
Silva Manuel
the Department of Electrical Engineering and Computer Science
関連論文
- Computing k-Edge-Connected Components of a Multigraph (Special Section on Discrete Mathematics and Its Applications)
- Design of a Dynamic Mutual Exclusion Algorithm for a Distributed Network of Autonomous Nodes (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)
- Qualitative Analysis of Periodic Schedules for Deterministically Timed Petri Net Systems (Special Section on Discrete Mathematics and Its Applications)
- A Linear Time Algorithm for Smallest Augmentation to 3Edge-Connect a Graph (Special Section on Discrete Mathematics and Its Applications)
- Computation of Minimum Firing Time for General Self-Cleaning SWITCH-Less Program Nets(Special Section of Papers Selected from ITC-CSCC'97)