Skip to main content
SpringerLink
Log in

Degrees of non-determinism and concurrency: A Petri net view

  • Invited Talk
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1984)

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

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. Applications and Theory of Petri Nets. Eds. C. Girault and W. Reisig. Informatik-Fachberichte 52, Springer Verlag, Berlin, Heidelberg, New York (1982).

    Google Scholar 

  2. Applications and Theory of Petri Nets. Eds. A. Pagnoni and G. Rozenberg, Informatik-Fachberichte 66, Springer Verlag, Berlin, Heidelberg, New York (1983).

    Google Scholar 

  3. E. Best: The Relative Strength of K-density. In [34].

    Google Scholar 

  4. E. Best, A. Merceron: Frozen Tokens and D-continuity. Proceedings of the 5th European Workshop on Applications and Theory of Petri Nets, Aarhus, Denmark (1984).

    Google Scholar 

  5. E. Best, M.W. Shields: Some Equivalence Results on Free Choice Nets and Simple Nets and on the periodicity of Live Free Choice Nets, Proceedings of the 8th Colloquium on Trees in Algebra and Programming (CAAP), L'Aquila (1983).

    Google Scholar 

  6. F. Commoner, A.W. Holt, S. Evens, A. Pnueli: Marked Directed Graphs. Journal of Computer and System Sciences 5 (1971), 511–523.

    Google Scholar 

  7. F. Commoner: Deadlocks in Petri Nets. Applied Data Research Inc., CA-7206-2311, Wakefield, Mass., USA (1972).

    Google Scholar 

  8. C. Fernandez, P.S. Thiagarajan: D-Continuous Causal Nets: A Model of Non-sequential Processes. Theoretical Computer Science 28 (1984), 171–196.

    Google Scholar 

  9. M.P. Flé, G. Roucairol: Fair Serializability of Iterated Transactions using FIFO Nets. Proceedings of the 4th European Workshop on Applications and Theory of Petri Nets, Toulouse, France (1983).

    Google Scholar 

  10. H.J. Genrich, K. Lautenbach: Synchronisationsgraphen. Acta Informatica 2 (1973), 143–161.

    Google Scholar 

  11. H.J. Genrich, G. Thieler-Mevisson: The Calculus of Facts. Lecture Notes in Computer Science 45, Springer Verlag, Berlin, Heidelberg, New York (1976), 588–595.

    Google Scholar 

  12. H.J. Genrich, K. Lautenbach, P.S. Thiagarajan: Elements of General Net Theory. In [34].

    Google Scholar 

  13. H.J. Genrich, K. Lautenbach: System Modelling with High-level Petri Nets. Theoretical Computer Science 13, (1981), 109–136.

    Google Scholar 

  14. H.J. Genrich, P.S. Thiagarajan: A Theory of Bipolar Synchronisation Schemes. Theoretical Computer Science 30 (1984), 1–78 (to appear).

    Google Scholar 

  15. 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), 357–381.

    Google Scholar 

  16. U. Goltz, W. Reisig: The Non-Sequential Behaviour of Petri Nets. Information and Control, 57 (1983), 125–147.

    Google Scholar 

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

    Google Scholar 

  18. M.H. Hack: Decidability Questions for Petri Nets. Ph.D. Thesis, TR-161, Project MAC, Cambridge, Mass., USA (1976).

    Google Scholar 

  19. A.W. Holt et al.: Information System Theory Project: Final Report. Applied Data Research Inc., RADC-TR-68-305, Princeton, N.J. (1968).

    Google Scholar 

  20. A.W. Holt: A Mathematical Model of Continuous Discrete Behaviour. Unpublished Manuscript (1980).

    Google Scholar 

  21. P. Huber, A.M. Jensen, L.O. Jepsen, K. Jensen: Towards Reachability Tree for High-level Petri Nets. Proceedings of the 5th European Workshop on Applications and Theory of Petri Nets, Aarhus, Denmark (1984).

    Google Scholar 

  22. K. Jensen: Coloured Petri Nets and the Invariant Method. Theoretical Computer Science 14 (1981), 317–336.

    Google Scholar 

  23. J.R. Jump, P.S. Thiagarajan: On the Equivalence of Asynchronous Control Structures, SIAM Journal on Computing 2, (1973), 67–87.

    Google Scholar 

  24. J.R. Jump, P.S. Thiagarajan: On the Interconnection of Asynchronous Control Structures. Journal of ACM 22, (1975), 596–612.

    Google Scholar 

  25. R.M. Karp, R.E. Miller: Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing. SIAM Journal of Applied Mathematics 14, 6 (1966), 1390–1411.

    Google Scholar 

  26. S.R. Kosaraju: Decidability of Reachability in Vector Addition Systems. Proceedings of the 14th Annual Symposium on Theory of Computing (1982).

    Google Scholar 

  27. K. Lautenbach: Exakte Bedingungen der Lebendigkeit für Eine Klasse von Petri Netzen. (In German.) Berichte der GMD 82, St. Augustin, W. Germany (1973).

    Google Scholar 

  28. E.W. Mayr: An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing 13, 3 (1984), 441–460.

    Google Scholar 

  29. A. Mazurkiewicz: Concurrent Program Schemes and their Interpretations. DAIMI PB-78, Computer Science Department, Aarhus University, Aarhus, Denmark (1979).

    Google Scholar 

  30. A. Mazurkiewicz: Semantics of Concurrent Systems. A Modular Fixed-Point Trace Approach. In: Advances in Applications and Theory of Petri Nets. (To appear.)

    Google Scholar 

  31. R. Milner: A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer Verlag, Berlin, Heidelberg, New York (1980).

    Google Scholar 

  32. R. Milner: A Complete Inference System for a Class of Regular Behaviours. Journal Computer and System Sciences 28 (1984), 39–466.

    Google Scholar 

  33. D.E. Muller, W.S. Bartky: A Theory of Asynchronous Circuits. The Annals of the Computation Laboratory of Harvard University, 29, Harvard University Press, Cambridge, Mass., USA (1959), 204–243.

    Google Scholar 

  34. Net Theory and Applications. Ed. W. Brauer, Springer Lecture Notes in Computer Science, 84, Springer Verlag, Berlin, Heidelberg, New York (1980).

    Google Scholar 

  35. M. Nielsen, G. Plotkin, G. Winskel: Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science 13 (1981), 85–108.

    Google Scholar 

  36. D.M. Park: Concurrency and Automata on Finite Sequences. Report, Computer Science Department, University of Warwick, Great Britain, (1981).

    Google Scholar 

  37. J.L. Peterson: Petri Nets and the Modelling of Systems. Prentice-Hall, Englewood Cliffs, N.J., USA (1981).

    Google Scholar 

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

    Google Scholar 

  39. C.A. Petri: Fundamentals of a Theory of Asynchronous Information Flow, Proceedings of IFIP Congress 62 (1962).

    Google Scholar 

  40. C.A. Petri: Concepts of Net Theory. Proceedings of the Mathematical Foundations of Computer Science Symposium and Summer School, High Tatras, Czechoslovakia (1973).

    Google Scholar 

  41. C.A. Petri: Interpretations of Net Theory. ISF Report 75.07, GMD, St. Augustin, W. Germany (1975).

    Google Scholar 

  42. C.A. Petri: Non-Sequential Processes. ISF Report 77.05, GMD, St. Augustin, W. Germany (1977).

    Google Scholar 

  43. C.A. Petri: Introduction to General Net Theory. In [34].

    Google Scholar 

  44. C.A. Petri: Concurrency. In [34].

    Google Scholar 

  45. W. Reisig: Petri Nets with Individual Tokens. In [2].

    Google Scholar 

  46. G. Rozenberg, R. Verraedt: Subset Languages of Petri Nets. In [2].

    Google Scholar 

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

    Google Scholar 

  48. P.S. Thiagarajan, K. Voss: A Fresh Look at Free Choice Nets. Arbeitspapiere der GMD, 58, GMD, St. Augustin, W. Germany (1983). (Also to appear in Information and Control.)

    Google Scholar 

  49. R. Valk: Infinite Behaviour of Petri Nets. Theoretical Computer Science 25 (1983), 311–341.

    Google Scholar 

  50. R. Valk, M. Jantzen: The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Proceedings of the 4th European Workshop on Applications and Theory of Petri Nets.

    Google Scholar 

  51. G. Winskel: Events in Computation. Ph.D. Thesis, Department of Computer Science, University of Edinburgh, Edinburgh, Scotland (1980).

    Google Scholar 

  52. G. Winskel: Event Structure Semantics for CCS and Related Languages. Lecture Notes in Computer Science 140, Springer Verlag, Berlin, Heidelberg, New York (1982), 561–576.

    Google Scholar 

  53. G. Winskel: A New Definition of Morphism on Petri Nets. Lecture Notes in Computer Science 166, Springer Verlag, Berlin, Heidelberg, New York (1984), 140–150.

    Google Scholar 

  54. G. Kahn: The Semantics of a Simple Language for Parallel Processing. Proceedings of IFIP Congress 74 (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Aarhus University, DK-8000, Aarhus C, Denmark

    M. Nielsen & P. S. Thiagarajan

Authors
  1. M. Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. S. Thiagarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mathai Joseph Rudrapatna Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nielsen, M., Thiagarajan, P.S. (1984). Degrees of non-determinism and concurrency: A Petri net view. In: Joseph, M., Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1984. Lecture Notes in Computer Science, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13883-8_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-13883-8_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13883-9

  • Online ISBN: 978-3-540-39087-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation