State Equation, Controllability, and Maximal Matchings of Petri Nets

IEEE Transactions on Automatic Control

Volumn 22, Issue 3, 1977, Pages 412-416

  Murata, Tadao ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

EID: 0017504301     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/TAC.1977.1101509     Document Type: Article

References (35)

1. C. A. Petri, “Communication with automata,” (transl. C. P. Greene, Jr., from “Kommunikation mit Automaten,” Univ. of Bonn, 1962), a Supplement to Tech. Doc. Rep. 1, prepared for Rome Air Development Center, Contract AF30(602)-3324, 1965.
2. A. W. Holt el., al “Final report of the information system theory project,” Rome Air Dev. Center, AD676-972, Sept. 1968.
3. A. W. Holt and F. G. Commoner, “Events and conditions,” Res. Rep. Appl. Data Res. Inc., Wakefield, MA, 1970.
4. F. G. Commoner, A. W. Holt, S. Even, and A. Pnueli, “Marked directed graphs,” J. Comput. Syst. Sci., vol. 5, pp. 511–532, Oct., 1971.
5. F. Commoner, “Deadlock in Petri nets,” Res. Rep. Appl. Data Res. Inc., Wakefield, MA, June, 1972.
6. J. D. Noe and G. J. Nutt, “Macro E-nets for representation of parallel systems,” IEEE Trans. Comput., vol. C-22, pp. 718–727, Aug. 1973.
7. G. J. Nutt, “Evaluation nets for computer system performance analysis,” in 1972 Fall Joint Computer Conf., AFIPS Conf. Proc., vol. 41. Montvale, NJ: AFIPS Press, 1972, 279–286.
8. J. R. Jump, “Asynchronous control arrays,” IEEE Trans. Comput., vol. C-23, pp. 1020–1029, Oct. 1974.
9. S. S. Patil, “Micro-control for parallel asynchronous computers,” Massachusetts Inst. Technol., Cambridge, Computation Structure Group Memo 120, Mar. 1975.
10. S. S. Reddi, “A parallel computer with centralized control,” IEEE Computer Repository, R76-22, Feb. 1976.
11. R. E. Miller, “Relationships among models of parallelism and synchronization,” in Conf. Proc. Petri Nets and Related Methods, July 1975.
12. J. A. Meldman and A. W. Holt, “Petri nets and legal systems,” Jurimetrics J., vol. 12, pp. 66–75, Dec. 1971.
13. S. Crespi-Reghizzi and D. Mandrioli, “Some algebraic properties of Petri nets,” Alta Frequenza, vol. XLV, pp. 130–137 (42E), Feb. 1976.
14. H. Hack, “Petri net languages,” Massachusetts Inst. Technol., Cambridge, Project MAC TM-124, June 1975.
15. P. M. Merlin, “A methodology for the design and implementation of communication protocols,” IEEE Trans. Commun., vol. COM-24, June 1976.
16. N. Deo, Graph Theory with Applications to Engineering and Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 1974.
17. M. Hack, “Analysis of production schemata by Petri nets,” Massachusetts Inst. Technol., Cambridge, Project MAC TR-94, Feb. 1972; with corrections in computation structure note 17, June 1974.
18. —, “Decision problems for Petri nets and vector addition systems,” Massachusetts Inst. Technol., Cambridge, Project MAC TM-59, Mar. 1975.
19. K. Lautenback and H. A. Schmid, “Use of Petri nets for proving correctness of concurrent process systems,” in Information Processing 74. Amsterdam, The Netherlands: North-Holland, 1974, 187–191.
20. E. Best and H. A. Schmid, “Systems of open paths in Petri nets,” in Proc. Math. Fund. Comput. Sci., Sept. 1975.
21. J. Van Leeuwen, “A partial solution to the reachability problem,” in Proc. 1974 ACM Symp. Theory of Computing, 1974.
22. B. O. Nash, “Reachability problems in vector addition systems,” Amer. Math. Mon., vol. 80, pp. 292–295, 1973.
23. T. Murata “Circuit theoretic analysis and synthesis of marked graphs,” IEEE Trans. Circuits and Systems, vol. CAS-24, July 1977, to be published.
24. C. T. Chen, Introduction to Linear System Theory. New York: Holt, Rinehart and Winston, 1970.
25. R. M. Karp and R. E. Miller, “Parallel program schemata,” J. Comput. Syst. Sci., vol. 3, pp. 147–195, May 1969.
26. T. Araki and T. Kasami, “Some undecidable problems about Petri nets,” Trans. IECE (Japan), vol. J59-D, Jan. 1976.
27. E. Cardoza, R. Lipton, and A. R. Meyer, “Exponential space complete problems for Petri nets and commutative semigroups,” in Proc. 1976 ACM Conf. Theory of Computing, 1976, 50–54.
28. F. E. Hohn, Elementary Matrix Algebra. New York: Macmillan, 1958.
29. T. Murata and T. Shah, “On liveness, deadlocks, and reachability of E-nets,” in Proc. 1976 Allerton Conf. Circuit and System Theory, Oct. 1976.
30. T. Murata, “Petri nets, marked graphs, and circuit-system theory,” IEEE Circuits and Systems Society Newsletter, vol. 11, June 1977, available from the author on request.
31. M. Hack, “The equivalence of generalized (multiple-arc) Petri nets and ordinary (single-arc) Petri nets,” Massachusetts Inst. Technol., Cambridge, Project MAC, Comp. Struct. Note 9, Apr. 1973.
32. —, “Decidability questions for Petri nets,” Massachusetts Inst. Technol., MIT lab, for Comput. Sci., TR-161, June 1976.
33. F. Commoner et al., “Final report for the project—development of theoretical foundations for description and analysis of discrete information systems,” vol. II-Mathematics, CASS-7405-2011, available form the Massachussets Computer Ass. Inc., Wakefield, MA, 01880, May 1974.
34. R. M. Karp and R. E. Miller, “Properties of a model for parallel computations: Determinacy, termination, queueing,” SIAM J. Appl. Math. vol. 14, pp. 1390–1411, Nov., 1966.
35. G. Sacerdote and R. L. Tenney, “The decidability of the reachability problem for vector addition systems.” to be published.