Author:
Ichikawa Atsunobu,Hiraishi Kunihiko
Reference24 articles.
1. Araki, T. and Kasami, T. (1977). Decidable Problem on the Strong Connectivity of Petri Net Reachability Sets. Theor. Comput. Science 4 (1), 97–119
2. Cohen, G., Moller, P. Quadrat, J.P. and Viot, M. (1984). Linear System Theory for Discrete Event Systems. Proc. 23-rd Int. Conf. Decision and Control. 1, 539–544
3. Gravowski, J. (1980). The decidability of Persistence for Vector Addition Systems. Inf. Proc. Letters 11(1) 20–23
4. Hiraishi, K. and Ichikawa, A. (1986). Conflict-free Places and Fireability of a Solution of Matrix Equation in Petri Nets. Trans. Soc. Instr. Contr. Engr.. 22(7), 750–755 (in Japanese)
5. Ho, Y.C. and Cassandras, C. (1983). A New Approach to the Analysis of Discrete Event Systems. Automatica, 19 (2) 149–167
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献