主催：計測自動制御学会 企画：離散事象システム部会
| 題目 | コーディネータを用いたリライアブルな分散スーパバイザ制御 |
| 著者 | ○高井重昌（和歌山大），潮 俊光（阪大） |
| 概要 | In our previous work, we formulated a reliable decentralized supervisory control problem, and presented necessary and sufficient conditions for the existence of a reliable decentralized supervisor. In this paper, we consider the case that there does not exist a reliable decentralized supervisor for a given specification language. We use not only local supervisors but also a centralized supervisor, called a coordinator, to design a reliable decentralized control system without altering the specification. In particular, we synthesize a coordinator whose control action is minimal. |
| 題目 | タイムペトリネットのサブクラスの活性問題について |
| 著者 | ○太田 淳（愛知県立大） |
| 概要 | This report studies analysis problems in Merlin's time Petri net, where each transition has minimum and maximum fring delay. This time Petri net is known to have equivalent modeling power to that of Turing machine. Thus most analysis problems of the general class of time Petri net are undecidable. Some problems might be decidable if we restrict the structure of the time Petri net. This report treats liveness problem of time partially ordered condition nets and reachability problem of time dissynchronous choice nets. |
| 題目 | 条件／事象ネットの段階的詳細化に関する考察 |
| 著者 | 橋爪 進，小野木克明（名大），西村義行（東邦大） |
| 概要 | The behavior of a condition/event net (C/E net) N can be correctly described by its activity denoted by FP(N). We have defined refinement of C/E nets as follows: For two C/E nets N and N', N' is said to be refinement of N, if FP(N') is equal to FP(N)[e/Y]PREF, where FP(N)[e/Y} is a partial language obtained by replacing the event e in FP(N) by a partial language Y. We first derive a necessary condition for the refinement nets of a given C/E net to exist. We next present a subclass of C/E nets and that of partial languages such that the condition becomes necessary and sufficient. |
| 題目 | 非有界ネットのアンフォールディング構成について |
| 著者 | ○笹川竜太郎，宮本俊幸，熊谷貞俊（阪大） |
| 概要 | Though Petri nets have powerful mathematical verification ability, in many cases we have to construct the state space for verification. We can avoid the state space explosion problem on bounded Petri nets by using unfolding. But, there is no idea for unbounded Petri nets. So, this paper proposes an algorithm to construct unfolding for unbounded Petri Nets, and proves coveravility and finiteness for unfolding constructed by the algorithm. |
| 題目 | アンフォールディングを用いた離散事象システムの状態フィードバック制御 |
| 著者 | ○宮本俊幸，熊谷貞俊（阪大） |
| 概要 | Synthesis of feedback control logic for live and safe marked graph has been given by Holloway and Krogh. The method strongly depends on the structure of marked graphs, and thus it has not been extended to wider classes. This paper considers synthesis of a maximal permissive feedback control for a special condition by using unfoldings. Unfoldings has similar structure to the marked graphs. Transforming a PN to an unfolding allows us to apply the Holloway's approach to general bounded PN's. |