James L. Peterson
- 1 AGERWALA, T. A complete model for representtng the coordination of asynchronous processes, Hopkins Computer Research Report No. 32, Computer Science Program, Johns Hopkins Univ., Baltimore, Md., July 1974, 58 pp.]]Google Scholar
- 2 AGERWALA, T. An analysis of controlhng agents for asynchronous processes, Hopkins Computer Research Report No. 35, Computer Scmnce Program, Johns Hopkins Univ., Baltimore, Md., Aug. 1974, 85 pp.]]Google Scholar
- 3 AGERWALA, T.; AND FLYNN M. "Comments on capabihtms, hmitations and 'correctness' of Petri nets," in Proc. 1st Annual Symp Computer Architecture, G. J. Lipovskl, and S. A. Szygenda (Eds.), ACM, N.Y., 1973, pp. 81-86.]] Google Scholar
- 4 ANDERSON, D W ; SPARACIO, F. J.; AND TOMA- SULO, R.M. "The IBM System/360 Model 91: Machine philosophy and instruction handling," IBM J. R. & D. 11, 1 (Jan. 1967), 8-24.]]Google Scholar
- 5 BAn, J.L. "Modelling for parallel computation: a case study," in Proc. 1973 Sagamore Computer Conf. Parallel Processing, Springer- Verlag, N.Y., 1973.]]Google Scholar
- 6 BABR, J. L. "A survey of some theoretical aspects of multiprocessing," Computing Surveys 5, 1 (March 1973), 31-80.]] Google Scholar
- 7 BAKER, H. G. Petri nets and languages, Computation Structures Group Memo 68, Project MAC, MIT, Cambridge, Mass., May 1972, 6 pp.]]Google Scholar
- 8 BAKES, H.G. "Equivalence problems of Petri nets," MS Thesis, Dep.t Electrical Eng,-" neering, MIT, Cambridge, Mass., June 1973, 53 pp.]]Google Scholar
- 9 BAKER, H.G. Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems, Computation Structures Group Memo 79, Project MAC, MIT, Cambridge, Mass., July 1973, 18 pp.]]Google Scholar
- 10 BERNSTEIN, A.J. "Program analysis for parallel processing," IEEE Trans. Electronic Comp. EC-15, (Oct. 1966), 757-762.]]Google Scholar
- 11 BeRNSTEIN, P.A. Description problems in the modeling of asynchronous computer systems, Tech. Rep. 48, Dept. Computer Science, Univ. Toronto, Toronto, Canada, Jan. 1973.]]Google Scholar
- 12 CBmz, V. G. "Multiprocessors, semaphores, and a graph model of computation," PhD Thesin, Computer Science Dept., Univ. Calif., Los Angeles, April 1972.]]Google Scholar
- 13 CHEN, T. C. "Overlap and pipeline processing," in Introduction to computer architecture, H. S. Stone (Ed.), Science Research Associates, Chicago, ill., 1975, pp. 375-431.]]Google Scholar
- 14 CLARK, W.A. "Macromodular computer systems," in Proc. 1967 Spring Jr. Comp Conf., Thompson Book Co., Washi" "ngton, D.C., 1967, pp. 335-336.]]Google Scholar
- 15 Cotr~As, E. G.; AND DENN~C, P. J. Operating systems theory, Ch. 2, Prentice- Hall, Englewood Cliffs, N. J., 1973, pp. 31-82.]] Google Scholar
- 16 COMMO~R, F. G. Deadlocks in Petri nets, CA-7206-2311, Applied Data Research, Wakefield, Mass., June 1972, 50 pp.]]Google Scholar
- 17 COMMONER, F.; HOLT, A. W.; EVEN, S.; AND PNU~.LI, A. "Marked directed graphs," J. Computer and Systems Science 5, (Oct. 1971), 511-523.]]Google Scholar
- 18 CRF~PI-REGHIZZI, S.; AND MANDRIOLI, D. "Properties of firing sequences," presented at MIT Conf. Petr~ Nets and Related Methods, MIT, Cambridge, Mass., July 1975.]]Google Scholar
- 19 CRESPI-REGHIZZI, S.; AND MANDRIOLI, D. Petri nets and commutative grammars, Internal Report No. 74-5, Laboratorio di Calcolatori, Instituto di Elettrotecnica ed Elettromca del Politecnico di Milano, Italy, March 1974.]]Google Scholar
- 20 CRESPI-REGHIZZI, S.; AND MANDRIOLI, D. "A decidability theorem for a class of vector-addition systems," Information Processing Letters 3, 3 (Jan. 1975), 78-80.]]Google Scholar
- 21 CEESPI-REGH|ZZI, S.; AND MANDEIOLI, D. "Petri nets and Szilard languages," Information and Control 33, 2 (Feb. 1977), 177-192.]]Google Scholar
- 22 DEN~IS, J. B. "Modular asynchronous control structures for a high performance processor," in Record of the Project MAC Conf. Concurrent and Parallel Computatwn, ACM, N. Y., 1970, pp. 55-80.]]Google Scholar
- 23 DzNms, J.B= (Ed.), Record of the project MAC conf. concurrent systems and parallel computation, ACM, N. Y., 1970, 199 pp.]]Google Scholar
- 24 DENms, J.B., Concurrency in software systems, Computation Structures Group Memo 65-1, Project MAC, MIT, June 1972, 18 pp.; also in Advanced course in software engineering, F. L. Bauer (Ed.), Springer-Verlag, Berlin, W. Germany, 1973, pp. 111-127.]] Google Scholar
- 25 DIJ~.STRA, E. W., "Cooperating sequential processes," in Programming languages, F. Genuys (Ed.), Academic Press, N. Y., 1968, pp. 43-112.]]Google Scholar
- 26 ~CHER, P. C.; ME~ZR, A. R.; ANY RosEbnE~, A.L. "Counter machines and counter languages," Mathemaacal Systems Theory 2, 3 (1968), 265-283.]]Google Scholar
- 27 FURTEX, F. "Modular implementation of Petri nets," MS Thesis, Dept. Electrical Engineering, MIT, Cambridge, Mass., Sept 1971.]]Google Scholar
- 28 FURTEK, F. C. "The logic of systems," PhD Thesis, Dept. ElectricalEngineering, MIT, Cambridge, Mass., May 1976; also Tech. Rep. 170, MIT Laboratory Computer Science, June 1976.]] Google Scholar
- 29 GENRICH, H. J. Einfache nicht-sequentielle Prozesse (Simple nonsequential processes), Gesellschaft fiir Mathematlk und Datenverarbeitung, Birlinghoven, W. Germany, 1970.]]Google Scholar
- 30 GENRICH, H. J. The Petr~ net representation of mathematical knowledge, GMD-ISF Internal Report 75-06, Institut fur Informationssystemforschung, Gesellschaft fiir Mathematik und Datenverarbeitung, Birlinghoven, W. Germany, 1975.]]Google Scholar
- 31 GosvELOW, K.P. "Flow of control, resource allocation and the proper termination of programs," PhD Thesis, Computer Scmnce Dept., Univ. Calif., Los Angeles, Dec. 1971, 219 pp.]] Google Scholar
- 32 HACK, M. "Analysis of production schemata by Petri nets," MS Thesis, Dept. Electrical Engineering, MIT, Cambridge, Mass.; also: MAC TR-94, Project MAC, MIT, Feb. 1972, 119 pp; Errata: Hack, M. Correctmns to 'Analysis of production schemata by Petri nets,' Computation Structures Note 17, Project MAC, MIT, June 1974, 11 pp.]] Google Scholar
- 33 HACK, M. A Petri net version of Robin's undecidability proof for vector addition systems, Computation Structures Group Memo 94, Project MAC, MIT, Cambridge, Mass., Dec. 1973, 12pp.]]Google Scholar
- 34 HACK, M. Decision problems for Petn nets and vector addition systems, Computation Structures Group Memo 95, Project MAC, MIT, Cambridge, Mass., March 1974; also Technical Memo 59, Project MAC, MIT, March, 1975.]]Google Scholar
- 35 HACK, M. The recursive equwalence of the reachability problem and the liveness problem for Petri nets and vector additmn systems, Computation Structures Group Memo 107, Project MAC, MIT, Cambridge, Mass., Aug. 1974, 9 pp.; also in Proc. 15th Annual Syrup. Switching and Automata, IEEE, N. Y., 1974.]]Google Scholar
- 36 HACK, M. The equality problem for vector addition systems ~s undecidable, Computation Structures Group Memo 121, Project MAC, MIT, Cambridge, Mass., April 1975, 32 pp.; also in Theoretical Computer Science 2, 1 (June 1976).]]Google Scholar
- 37 HACK, M. Petri net languages, Computation Structures Group Memo 124, Project MAC, MIT, Cambridge, Mass., June 1975, 128 pp.; also TR 159, Laboratory Computer Science, MIT, March 1976.]] Google Scholar
- 38 HACK, M. "Decidability questions for Petri nets," PhD Thesis, Dept. Electrical Engineering, MIT, Cambridge, Mass., Dec. 1975; also TR-161, Laboratory Computer Science, MIT, June 1976, 194 p~.]] Google Scholar
- 39 HAcz, M.; ~m ~'ETERSON, J. L. "Petri nets and languages," presented at MIT Conf. Petn Nets and Related Methods, MIT, Cambridge, Mass., July 1975.]]Google Scholar
- 40 HANSAL, A.; AND SCHWAB, G.M. On marked graphs III, Report LN 25.6.038, IBM Vienna Laboratories, Vienna, Austrm, Sept. 1972.]]Google Scholar
- 41 HENHAPL, W. Firing sequences of marked graphs, Report LN 25.6.023, IBM Vienna Laboratories, Vienna, Austria, June 1972.]]Google Scholar
- 42 HENHAPL, W. Finn g sequences of marked graphs II, Report LN 25.6.036, IBM Vienna Laboratories, Vienna, Austria, June 1972.]]Google Scholar
- 43 HOLT, A. W.; SAINT, H ; SHAPIRO, R. M.; ANY WARSHALL, S. Final report of the mformatmn system theory project, Tech. Rep. RADC-TR- 68-305, Rome Air Development Center, Griffiss Air Force Base, N. Y., Sept. 1968.]]Google Scholar
- 44 HOLT, A. W.; AND COMMONER, F. JF, t;ents and condition, Applied Data Research N.Y., 1970; also in Record Project MAC Conf. Concurrent Systems and Parallel Computatton, (Chapters I, II, IV, and VI) ACM, N.Y., 1970, pp. 3-52.]]Google Scholar
- 45 HOLT, R. C. "On deadlock m computer systems," PhD Thesis, Dept. Computer Science, Cornell Umv., Ithaca, N Y., Jan. 1971; also TR 71-91, Dept. Computer Science, Cornell Univ.; and TR CSRG-6, Computer Science Research Group, Umv. Toronto, Toronto, Canada, July 1972.]]Google Scholar
- 46 IZmCKI, H. On marked graphs, Report LR 25.6.023, IBM Vienna Laboratories, Vienna, Austria, Sept. 1971.]]Google Scholar
- 47 IzBIcKI, H. On marked graphs H, Report LN 25.6.029, IBM Vienna Laboratories, Vienna, Austria, Jan. 1972.]]Google Scholar
- 48 JACK, L. "Graphical representation for fault tolerant phenomena," presented at Seminar, Dept. Electrical Engineering, Univ. Texas, Austin, Jan. 1976.]]Google Scholar
- 49 JONES, N. D.; LAm)W~,BER, L. H.; AND LIEN, Y. E. Complexity of some problems in Petri nets, TR-276, Comp. Science Dept., Umv. Wisconsin-Madison, Sept. 1976, 43 pp.; to appear in Theor. Comp. Sci.]]Google Scholar
- 50 Kxm,, R. M.; AND Mn~LER, R.E. "Properties of a model for parallel computation: determinacy, termination, queueing," SIAM J. Appl. Math. 14, 6 (Nov. 1966) 1390-1411.]]Google Scholar
- 51 KARP, R. M.; AND MILLER, R. E. 'Tarallel ~ rogram schemata," J. Computer and Systems cience 3, 4 (May 1969), 167-195.]]Google Scholar
- 52 KAsAm, T.; TOKURA, N.; AND PETERSON, W. W. "Vector addition systems and synchronization problems of concurrent processes," draft manuscript, 1974.]]Google Scholar
- 53 KELLER, R.M. Vector replacement systems: a formahsm for modelhng asynchronous systems, Tech. Rep. 117, Computer Science Laboratory, Princeton Umv., Princeton, N.J., Dec. 1972; Revised: Jan. 1974, 57 pp.]]Google Scholar
- 54 KELLER, R. M. Generaltzed Petrt nets as models for system verification, Tech. Rep. 202, Dept. Electrical Engineering, Princeton Univ., Princeton, N.J., Aug. 1975.]]Google Scholar
- 55 KELLER, R. M. "Look-ahead processors," Computzng Surveys 7, 4 (Dec. 1975), 177-196.]] Google Scholar
- 56 KELLER, R.M. ~Formal verifw.ation of paral- !el programs," Comm. ACM 19, 7 (July 1976), 371-384.]] Google Scholar
- 57 KOSARA~U, S. R. Limitations of Dijkstra's semaphore primitives and Petri nets, Tech. Rep. 25, Jol~ns Hopkins Univ., Baltimore, Md. May 1973, 5 pp.; also in Operating Systems Review 7, 4 (Oct. 1973), 122-126.]] Google Scholar
- 58 LANDWEBER, L. H.; Am) ROBERTSON, E. L. Properties of conflict ~_ e and pe:rslstent Petrt nets, Tech. Rep. 264, Computer Sciences Dept., Univ. Wisconsin-Madison, Madison, Wisc., Dec. 1975, 30 ~p.]]Google Scholar
- 59 LAUER, P. E.; aND t~Am'B~LL, R. H. A de. scription of path expressions by Petri nets, Tech. Rep. 64, Computing Laboratory, Univ. Newcastle Upon Tyne, England, May 1974, 39]]Google Scholar
- 60 LAUZR, P. E. Path expressions as Petri nets, or Petri nets with fewer tears, MRM 70, Computing Laboratory, Univ. Newcastle Upon Tyne, England, Jan. 1974, 61 pp.]]Google Scholar
- 61 LAUTENBACH, K.; AND SCHMID, H.A. "Use of Petri nets for proving correctness of concurrent process systems," in Proc. IFIP Congress 74, North-Holland Publ. Co., Amsterdam, The Netherlands, 1974, pp. 187-191.]]Google Scholar
- 62 LIzN, Y.E. "Termination properties of generalized Petri nets," SIAM J. Computing 5, 2 (June 1976), 251-265.]]Google Scholar
- 63 LIPTON, R. J.; SNYDBR, L.; ASD ZALC~ZIN, Y. "A comparative study of models of parallel computation," inProc, l@th Annual Syrup. Switching and Automata, IEEE, N.Y., 1974, p} p. 145-155.]]Google Scholar
- 64 LIPTos, R. "The reachability problem and the boundedness problem for Petri_ nets are exponential-space hard," presented at MIT Conf. Petri Nets and Related Methods, MIT, Cambridge, Mass., July 1975; also TR-62, Dept. Computer Science, Yale Univ., New Haven, Conn., Jan. 1976.]]Google Scholar
- 65 MELDMAN, J. A.; AND HOLT, A. W. ~Petri nets and legal systems," Jurimetrics J. 12, 2 (Dec. 1971).]]Google Scholar
- 66 MERLIN, P.A. "A study of recoverability of computing systems," PhD. Thesis, Dept. Information and Computer Science, Univ. Calif. Irvme, 1974, 165 pp.]] Google Scholar
- 67 MISUNAS, D. "Petri nets and speed independent design," Comm. ACM 16, 8 (Aug. 1973), 474-481.]] Google Scholar
- 68 MXLLER, R. E. A comparison of some theoretical models of parallel computation, RC 4230, IBM T.J. Watson Research Center, Yorktown Heights, N.Y.; also IEEE Trans. Comp. C-22, 8 (Aug. 1973), 710-717.]]Google Scholar
- 69 MURATA, T.; A~ CHURCH, R.W. Analysis of marked graphs and Petri nets by matrix equat/ons, Research Report MDC 1.1.8, Dept. Information Engineering, Univ. illinois, Chicago Circle, Nov. 1975, 25 pp.]]Google Scholar
- 70 NASH, B. O. "Reachability problems in vector addition systems," American Math. Monthly 80, 3 (March 1973), 292-295.]]Google Scholar
- 71 Noz, J. D. A Petri net model of the CDC 6400, Report 71-04-03, Computer Science Dept., Umv'. Washington, 1971; also in Proc. A CM SIGOPS Workshop on System Performance Evaluation, ACM, N.Y., 1971, pp. 362- 378.]] Google Scholar
- 72 NoB, J. D.; Am) NuTr, G.J. "Macro E-Nets for representation of parallel systems," IEEE Trans. Comp. C-22, 8 (Aug. 1973), 718-727.]]Google Scholar
- 73 PA~IL, S. S. "Coordination of asynchronous events," PhD Thesis, Dept. Electrical Engineering, MIT, Cambridge, Mass., May 1970; also MAC TR-72, Project MAC, MIT, June 1970, 236 p~...]] Google Scholar
- 74 PATIL, S. Limttations and eapabdtttes of Dijkstra's semaphore prtmitives for coordina. twn among processes , Computation Structures Group Memo 57, Project MAC, MIT, Cambridge, Mass., Feb. 1971.]]Google Scholar
- 75 PATIL, S. S. Ctrcutt tmplementatton of Petri nets, Computation Structures Group Memo 73, Project MAC, MIT, Cambridge, Mass., Dec. 1972, 14 pp.]]Google Scholar
- 76 PATIL, S. S.; AND DENmS, J.B. The descrtptwn and realazatton of dtgttal systems, Computation Structures Group Memo 71, Project MAC, MIT, Cambridge, Mass., Oct. 1972; also in Proc. Stxth AnnuallEEE Computer Soctety Internatl. Conf. Digest of Papers, IEEE, N.Y., 1972.]]Google Scholar
- 77 PET~RSON, J. L. "Modelhng of parallel systems," PhD Thesis, Dept. Electrical Engineering, Stanford Univ., Stanford, Cahf., Dec. 1973, 241 pp.]]Google Scholar
- 78 PZTZRSO~, J. L ; Am) BREDT, T. H. "A comparison of models of parallel computatlon," in roc. IFIP Congress 74, North-Holland Publ. Co., Amsterdam, The Netherlands, 1974, pp. 466-470.]]Google Scholar
- 79 PZTERsoN, J. L. "Computation sequence sets," J. Computer and System Sciences 13, 1 (Aug. 1976) 1-24.]]Google Scholar
- 80 rEVR1, C. A'. "Kommunlkahon mit Automaten," Schriften des Rheintsch- Westfal-ischen Inst_ttutes ~r Instrumentelle Mathemattk an tier Universtrat Bonn, Heft 2, Bonn, W. Germany 1962; translation: C. F. Greene, Supplement 1 to Tech. Rep. RADC-TR-65-337, Vol. 1, Rome Air Development Center, GrifFins Air Force Base, N.Y., 1965, 89 pp.]]Google Scholar
- 81 P~ZTR}, C. A. "Concepts of net theory," in Proc. Symp. and Summer School on Mathematical Foundations of Computer Science, High Tatras, Sept. 3-8, 1973, Math. Inst. Slovak Academy of Science, 1973, pp. 137-146.]]Google Scholar
- 82 P~TRI, C.A. Interpretattons of net theory, Interner Bericht 75-07, Gesellschaft fur Mathematik und Datenverarbeltung, Bonn, W. Germany, July 1975, 34 pp.]]Google Scholar
- 83 RACteOFF, C. The covering and boundedness ~e roblems for vector addttion systems, Tech. p. 97, Dept. Computer Science, Univ. Toronto, Toronto, Canada, July 1976, 14 pp.]]Google Scholar
- 84 RAMCHANDANI, C. "Analysis of asynchronous concurrent systems by timed Petn nets," PhD Thesis, Dept. Electrical Engineering, MIT, Cambridge, Mass., 1974; also MAC-TR- 120, Project MAC, MIT, Feb. 1974.]] Google Scholar
- 85 RXDDLE, W.E. "The modelhng and analysis of supervisory systems," PhD Thesis, Computer Science Dept., Stanford Umv., Stanford, Calif., March 1972, 173 pp.]] Google Scholar
- 86 RIVDLE, W.E. The equzvalence of Petrz nets and message transmission models, SRM 97, Umv. Newcastle Upon Tyne, England, Aug. 1974, 11 pp.]]Google Scholar
- 87 RovmGVZZ, J.E. "A graph model for parallel computation," PhD Thesis, Dept. Electrical Engineering, MIT, Cambridge, Mass., Sept. 1967, 120 pp.]]Google Scholar
- 88 SACERDOTE, G.; AND TENNEY, R.L. "The decidabllity of the reachability problem for vector addition systems," (submitted for publication), Nov. 1976, 8pp.]]Google Scholar
- 89 SLUTZ, D. R. "The flow graph schemata model of parallel computation," PhD Thesis, Dept Electrical Engineering, MIT, Cambridge, Mass., Sept. 1968.]]Google Scholar
- 90 SHAPIRO, R. M.; AND SAZ~T, H. "A new approach to optimlzation of sequencing decisions," Annual Review of Automatlc Programmtng 6, 5, (1970), 257-288.]]Google Scholar
- 91 THORNTON, J. E. Design of a computer, the Control Data 6600, Scott, Foresman and Co., Glenview, Ill., 1970, 181 pp.]] Google Scholar
- 92 TSlCHR~ZlS, D. Modular system descr~ptlon, Tech. Rep. 33, Dept. Computer Science, Univ. Toronto, Toronto, Canada, Oct. 1971, 20 pp.]]Google Scholar
- 93 VAN LESVWEN, J. "A partial solution to the reachabdity-problem for vector addltlon systems," in Proc 6th Annual ACM Symp. Theory of Computing, ACM, N.Y., 1974, pp. 303- 309.]] Google Scholar
Recommendations
Non Equivalence between Time Petri Nets and Time Stream Petri Nets
PNPM '99: Proceedings of the The 8th International Workshop on Petri Nets and Performance ModelsIt had been shown that Merlin's Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that it does not exist a time equivalence between both models. We extend first this result to the nonequivalence of Timed Automata and ...
From Petri Nets to colored Petri Nets: a tutorial introduction to nets based formalism for modeling and simulation
WSC '19: Proceedings of the Winter Simulation ConferencePetri Net, a widely studied mathematical formalism, is a graphical notation for modeling systems. Petri Nets provide the foundation for modeling concurrency, communication, synchronization, and resource sharing constraints that are inherent to many ...
Petri nets and resource bisimulation
Concurrency Specification and Programming (CS&P'2002), Part 2Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn't change the Petri net's behavior. We define the relations of resource similarity and resource ...
Comments