This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Araki, T. and Kasami, T. (1977). Decidable Problem on the Strong Connectivity of Petri Net Reachability Sets. Theor. Comput. Science 4 (1), 97–119
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
Gravowski, J. (1980). The decidability of Persistence for Vector Addition Systems. Inf. Proc. Letters 11(1) 20–23
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)
Ho, Y.C. and Cassandras, C. (1983). A New Approach to the Analysis of Discrete Event Systems. Automatica, 19 (2) 149–167
Hopcroft, J. and Pansiot, J.J. (1979). On the Reachability Problem for 5-dimentional Vector Addition Systems. Theor. Comput. Science 8, 135–159
Ichikawa, A. and Hiraishi, K. (1984). Necessary and Sufficient Condition for a class of Reachability in Petri nets. Trans. Soc. Instr. Contr. Engr.. 20(8), 762–764 (in Japanese)
Ichikawa, A. and Ogasawara, K. (1986). Observation of markings in Petri Nets. Trans. Soc. Instr. Contr. Engr. 21(4), 324–330 (in Japanese)
Ichikawa, A., Yokoyama, K. and Kurogi S. (1985). Control of Event-driven Systems — Reachability and Control of Conflict-free Petri nets-. Trans. Soc. Instr. Contr. Engr. 21(4), 324–330 (in Japanese)
Ichikawa, A., Yokoyama, K. and Kurogi S. (1985). Reachability and Control of Discrete Event Systems Represented by Petri Nets. Proc. Int. Symp. Circuits and Systems 1985, 2, 487–490
Landweber, L.H. and Robertson, E.L. (1978). Properties of Conflict-free and Persistent Petri nets. Journal of the ACM. 25, 352–364.
Mayr, E. W. (1981). Persistence of Vector Replacement System is Decidable. Acta Informatica 15, 309–318
Mayr, E. W. (1984). An Algorithm for the General Petri Net Reachability Problem. SIAM J. Comput. 13(3) 441–460
Muller, H. (1980). Decidability of Reachbility in Persistent Vector Replacement Systems. Lecture Notes in Computer Science, 88, 426–438
Murata, T. (1977). Circuit Theoretic Analysis and Synthesis of Marked Graph. IEEE Trans. Circuits and Systems. CAS-24(7), 400–405
Peterson J.L. (1981). Petri Net Theory and The Modeling of Systems, Prentice-Hall
Petri C.A. (1962). Fundamentals of a Theory of Asynchronous Information Flow,. Proc. IFIP Congress 1962. 386–390
Ramadge, P.J. and Wonham, W.M. (1982). Algebraic Decomposition of Controlled Sequential Machines. Proc. 8-th World Congress IFAC, 1, 313–318
Ramadge, P.J. and Wonham, W.M. (1982) Supervision of Discret Event Processes. Proc. 21st IEEE Conf. Decision and Control. 3, 1228–1229
Reisig, W. (1985) Petri Nets, An Introduction. Springer-Verlag
Sasaki, I. (1986). Modeling and Language Acception Power of Decision-free Petri nets. BS thesis, Department of Systems Science, Tokyo Institute Technology.
Shepardson, J. and Sturgis, H. (1963). Computability of Recursive Functions, Journal of the ACM, 10(2), 217–255
Yamasaki H. (1981). On Weak Persistency of Petri nets. Inf. Proc. Letters, 13(1): 94–97
Yamasaki H. (1984). Normal Petri Nets. Theor, Comput. Science, 31 (3) 307–315
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 International Institute for Applied Systems Analysis
About this paper
Cite this paper
Ichikawa, A., Hiraishi, K. (1988). Analysis and control of discrete event systems represented by petri nets. In: Varaiya, P., Kurzhanski, A.B. (eds) Discrete Event Systems: Models and Applications. Lecture Notes in Control and Information Sciences, vol 103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0042308
Download citation
DOI: https://doi.org/10.1007/BFb0042308
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18666-3
Online ISBN: 978-3-540-48045-7
eBook Packages: Springer Book Archive