Skip to main content
SpringerLink
Log in

Some aspects of net theory

  • 2. Tutorial Papers
  • Conference paper
  • First Online:
The Analysis of Concurrent Systems

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 207))

  • 125 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Best: The Relative Strength of K-density. LNCS 84 (1980)

    Google Scholar 

  2. E. Best, A. Merceron: Discreteness, K-density and D-continuity of Occurrence Nets. LNCS 145 (1982)

    Google Scholar 

  3. E. Best, M.W. Shields: Some Equivalence Results on Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets. Proc. CAAP (1983)

    Google Scholar 

  4. E. Best, K. Voss: Free Choice Systems have Home States. Arbeitspapiere der GMD 46, GMD, St. Augustin, W. Germany (1983)

    Google Scholar 

  5. F. Commoner, A.W. Holt, S. Evens, A. Pnueli: Marked Directed Graphs. TCSS 5 (1971)

    Google Scholar 

  6. F. Commoner: Deadlocks in Petri Nets. Applied Data Research Inc., CA-7206-2311, Wakefield, Mass., U.S.A (1972)

    Google Scholar 

  7. C. Fernandez, P.S. Thiagarajan: D-continuous Causal Nets: A Model onf Non-sequential Processes. ISF Report 82.05, GMD, St. Augustin, W. Germany. (to Appear in TCS.) (1982)

    Google Scholar 

  8. H.J. Genrich, K. Lautenbach: Synchronisationsgraphen. Acta Informatica 2 (1973)

    Google Scholar 

  9. H.J. Genrich, G. Thieler-Mevisson: The Calculus of Facts. LNCS 45 (1976)

    Google Scholar 

  10. H.J. Genrich, K. Lautenbach: System Modelling with High-level Petri Nets. TCS 13 (1981)

    Google Scholar 

  11. H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: Elements of General Net Theory. LNCS 84 (1980)

    Google Scholar 

  12. H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: Substitution Systems: A Family of System Models based on Concurrency. LNCS 88 (1980)

    Google Scholar 

  13. H.J. Genrich, P.S. Thiagarajan: A Theory of Bipolar Synchronisation Schemes. Report DAIMI PB-158, Aarhus University, Aarhus, Denmark. (to. Appear in TCS). (1983)

    Google Scholar 

  14. H.J. Genrich, P.S. Thiagarajan: Well-formed Flow Charts for Concurrent Programming. In: Formal Description of Programming Concepts-II, Ed. D. Bjørner, North-Holland Publishing Company, Amsterdam, New York, Oxford (1983)

    Google Scholar 

  15. U. Goltz, W. Reisig: Processes in Place/Transition Nets. Proc. ICALP'83, LNCS (1983).

    Google Scholar 

  16. M.H. Hack: Analysis of Production Schemata by Petri Nets. M.S. Thesis, TR-94, Project MAC, MIT, Cambridge, Mass., U.S.A. (1972).

    Google Scholar 

  17. M.H. Hack: Decidability Questions for Petri Nets. Ph.D. Thesis, TR 161, Project MAC, MIT, Cambridge, Mass., U.S.A. (1976)

    Google Scholar 

  18. C.A.R. Hoare: Communicating Sequential Processes. CACM 21, 8 (1978)

    Google Scholar 

  19. K. Jensen: Coloured Petri Nets and the Invariant Method. TCS 14 (1981)

    Google Scholar 

  20. J.R. Jump, P.S. Thiagarajan: On the Equivalence of Asynchronous Control Structures. SIAM J. on Computing, 2, 2 (1973)

    Google Scholar 

  21. W. Kluge, K. Lautenbach: The Orderely Resolution of Memory Access Conflicts among Competing Channel Processes. IEEE Transactions on Computers, C-31, 3 (1982)

    Google Scholar 

  22. S.R. Kosaraju: Decidability of Reachability in Vector Addition Systems. Proc. 14th Annual ACM Symp. on Theory of Computing. (1982)

    Google Scholar 

  23. P.E. Lauer, P.R. Torrigiani, M.W. Shields: COSY-A System Specification Language Based on Paths and Processes. Acta Informatica 12 (1979)

    Google Scholar 

  24. K. Lautenbach: Simple Marked-graph-like Predicate Transition Nets. Arbeitspapiere der GMD 41, GMD, St. Augustin, W. Germany (1983)

    Google Scholar 

  25. R. Milner: A Calculus of Communicating Systems. LNCS 92 (1980)

    Google Scholar 

  26. N. Nielson, G. Plotkin, G. Winskel: Petri Nets, Event Structures and Domains, Part I. TCS 13 (1981)

    Google Scholar 

  27. C.A. Petri: Kommunikation mit Automaten. Schriften des IIM 2, Institute für Instrumentelle Mathematik, Bonn, W. Germany (1962)

    Google Scholar 

  28. C.A. Petri: Fundamentals of the Representation of Discrete Processes. English Translation of a paper (in german) Presented at 3. Colloquium über Automatentheorie 1965, ISF-Report 82-04, GMD, St. Augustin, W. Germany (1982)

    Google Scholar 

  29. C.A. Petri: Concepts of Net Theory. Proc. of MFCS'73

    Google Scholar 

  30. C.A. Petri: Interpretations of Net Theory. Interner Bericht ISF-75-07, GMD, St. Augustin, W. Germany (1975)

    Google Scholar 

  31. C.A. Petri: Non-sequential Processes. Interner Bericht ISF-77-5, GMD, St. Augustin, W. Germany (1977)

    Google Scholar 

  32. C.A. Petri: Concurrency. LNCS 84 (1980)

    Google Scholar 

  33. C.A. Petri: State-Transition Structures in Physics and in Computation. International J. of. Theor. Physics, 21, 12 (1982)

    Google Scholar 

  34. J.L. Peterson: Petri Nets and the Modelling of Systems. Prentice-Hall, Englewood Cliffs, N.J., U.S.A. (1981)

    Google Scholar 

  35. W. Reisig: Petri Nets with Individual Tokens. Informatik-Fachberichte 66, Springer Verlag (1983)

    Google Scholar 

  36. R.M. Smullyan: First-order Logic. Ergebnisse der Mathematik und ihrer Grenzgebiete, 43, Springer Verlag (1968)

    Google Scholar 

  37. P.S. Thiagarajan, K. Voss: A Fresh Look at Free Choice Nets. To Appear as Arbeitspapiere der GMD, St. Augustin, W. Germany.

    Google Scholar 

  38. K. Voss: Using Predicate/Transition Nets to Model and Analyse Distributed Data Base Systems. IEEE Transactions on Software Engineering, SE-6, 6. (1980)

    Google Scholar 

  39. G. Winskel: Events in Computation. Ph.D. Thesis, Dept. of Computer Science, University of Edinburgh, Edinburgh, G.B. (1980)

    Google Scholar 

  40. G. Winskel: Event Structure Semantics for CCS and Related Languages. LNCS 140 (1982)

    Google Scholar 

  41. G. Winskel: A new Definition of Morphism on Petri Nets. Unpublished Manuscript. (1983)

    Google Scholar 

  42. Net Theory and Applications. LNCS 84 (1980)

    Google Scholar 

  43. C.L. Seitz: System Timing. In: Introduction to VLSI Systems, (Mead, Conway), Addison-Wesley Publishing Company (1980).

    Google Scholar 

  44. M. Jantzen, R. Valk: Formal Properties of Place/Transition Nets. LNCS 84 (1980).

    Google Scholar 

Download references

Author information

Author notes

  1. P. S. Thiagarajan

    Present address: the university of Aarhus, Denmark

Authors and Affiliations

  1. GMD, Schloß Birlinghoven, 5205, St. Augustin, W. Germany

    P. S. Thiagarajan

Authors
  1. P. S. Thiagarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. T. Denvir W. T. Harwood M. I. Jackson M. J. Wray

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thiagarajan, P.S. (1985). Some aspects of net theory. In: Denvir, B.T., Harwood, W.T., Jackson, M.I., Wray, M.J. (eds) The Analysis of Concurrent Systems. Lecture Notes in Computer Science, vol 207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16047-7_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-16047-7_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16047-2

  • Online ISBN: 978-3-540-39731-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation