Skip to main content
SpringerLink
Log in

Occurrence Nets Then and Now: The Path to Structured Occurrence Nets

  • Conference paper
Book cover Applications and Theory of Petri Nets (PETRI NETS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6709))

Abstract

This lecture, in honour of the late Carl Adam Petri, tells of my early interactions with him and summarizes a small sequence of research projects at Newcastle University from 1977 onwards that relate to occurrence nets, ending with a description of a planned new project on “structured occurrence nets”. The areas of actual or planned application include deadlock avoidance, error recovery, atomicity, failure analysis, system synthesis and system verification.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avizienis, A., Laprie, J.C., et al.: Basic Concepts and Taxonomy of Dependable and Secure Computing. IEEE Transactions on Dependable and Secure Computing 1, 11–33 (2004)

    Article  Google Scholar 

  2. Best, E., Randell, B.: A Formal Model of Atomicity in Asynchronous Systems. Acta Informatica 16, 93–124 (1981)

    Article  MATH  Google Scholar 

  3. Bilinski, K., Dagless, E.L., et al.: Behavioral Synthesis of Complex Parallel Controllers. In: Proc. of 9th International Conference on VLSI Design, pp. 186–191. IEEE, Los Alamitos (1996)

    Google Scholar 

  4. Brauer, W. (ed.): Net Theory and Applications. Proceedings of the Advanced Course on General Net Theory of Processes and Systems. LNCS, vol. 340. Springer, Heidelberg (1980)

    Google Scholar 

  5. Campbell, R., Habermann, A.N.: The Specification of Process Synchronization by Path Expressions. In: Proc. of Symposium on Operating Systems, pp. 89–102 (1981)

    Google Scholar 

  6. Esparza, J., Heljanko, K.: Unfoldings: a Partial-order Approach to Model Checking. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  7. Herlihy, M., Moss, J.E.B.M.: Transactional Memory: Architectural Support for Lock-Free Data Structures. In: Proc. of 20th Annual International Symposium on Computer Architecture, pp. 289–300 (1993)

    Google Scholar 

  8. Holt, A.W., Shapiro, R.M., et al.: Information System Theory Project (Appl. Data Research [1] ADR 6606). RADC-TR-68-305, US Air Force, Rome Air Development Center (1968)

    Google Scholar 

  9. Horning, J.J., Lauer, H.C., et al.: A Program Structure for Error Detection and Recovery. In: Gelenbe, E., Kaiser, C. (eds.) Operating Systems. LNCS, vol. 16, pp. 171–187. Springer, Heidelberg (1974)

    Chapter  Google Scholar 

  10. Jones, C., Lomet, D.B., et al.: The Atomic Manifesto: A Story in Four Quarks. SIGMOD Record 34, 63–69 (2005)

    Article  Google Scholar 

  11. Khomenko, V., Koutny, M., et al.: Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT. Fundamenta Informaticae 70, 49–73 (2006)

    MathSciNet  MATH  Google Scholar 

  12. Khomenko, V., Koutny, M.: Verification of Bounded Petri Nets Using Integer Programming. Formal Methods in System Design 30, 143–176 (2007)

    Article  MATH  Google Scholar 

  13. Koutny, M.: O Problemie Pociagów Merlina-Randella (in Polish). PhD Thesis, Department of Mathematics, Warsaw University of Technology, Warsaw, Poland (1984)

    Google Scholar 

  14. Koutny, M.: On the Merlin-Randell Problem of Train Journeys. In: Paul, M., Robinet, B. (eds.) Programming 1984. LNCS, vol. 167, pp. 179–190. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  15. Koutny, M.: Train Journeys in the Merlin-Randell Problem. TR-205, Computing Laboratory, Newcastle University (1985)

    Google Scholar 

  16. Koutny, M., Randell, B.: Structured Occurrence Nets: A formalism for Aiding System Failure Prevention and Analysis Techniques. Fundamenta Informaticae 97, 41–91 (2009)

    MathSciNet  MATH  Google Scholar 

  17. Larus, J., Kozyrakis, C.: Transactional Memory. Communications of the ACM 51, 80–88 (2008)

    Article  Google Scholar 

  18. Lauer, P.E., Campbell, R.H.: A Description of Path Expressions by Petri Nets. In: Proc. of 2nd ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 95–105. ACM, New York (1975)

    Google Scholar 

  19. Lomet, D.B.: Process Structuring, Synchronization, and Recovery Using Atomic Actions. ACM SIGPLAN Notices 12, 128–137 (1977)

    Article  Google Scholar 

  20. McMillan, K.L.: A Technique of State Space Search Based on Unfolding. Formal Methods in System Design 6, 45–65 (1995)

    Article  MATH  Google Scholar 

  21. Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD Thesis, University of California, Irvine (1974)

    Google Scholar 

  22. Merlin, P.M., Schweitzer, P.J.: Deadlock Avoidance in Store-And-Forward Networks. In: Jerusalem Conference on Information Technology, pp. 577–581 (1978)

    Google Scholar 

  23. Merlin, P.M., Randell, B.: Notes on Deadlock Avoidance on the Train Set. MRM/144, Computing Laboratory, Newcastle University (1978), http://homepages.cs.ncl.ac.uk/brian.randell/MRM144.pdf

  24. Merlin, P.M., Randell, B.: State Restoration in Distributed Systems. In: Proc. of 8th International Symposium on Fault-Tolerant Computing, pp. 129–134. IEEE Computer Society Press, Los Alamitos (1978)

    Google Scholar 

  25. Petri, C.A.: Nicht-sequentielle Prozesse. ISF-Bericht ISF-76-6, Gesellschaft für Mathematik und Datenverarbeitung Bonn (1976)

    Google Scholar 

  26. Petri, C.A.: General Net Theory. In: Proc. of 1976 Joint IBM/Univ. of Newcastle upon Tyne Seminar on Computing System Design, Newcastle upon Tyne, Computing Laboratory , pp. 131–169 (1977) , http://homepages.cs.ncl.ac.uk/brian.randell/GeneralNetTheory.pdf

  27. Petri, C.A.: Communication Disciplines. In: Proc. of 1976 Joint IBM/Univ. of Newcastle upon Tyne Seminar on Computing System Design, Newcastle upon Tyne, Computing Laboratory, pp. 171–183 (1977), http://homepages.cs.ncl.ac.uk/brian.randell/CommunicationDisciplines.pdf

  28. Poliakov, I., Khomenko, V., et al.: Workcraft — A Framework for Interpreted Graph Models. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. LNCS, vol. 5606, pp. 333–342. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  29. Randell, B.: System Structure for Software Fault Tolerance. IEEE Trans. on Software Engineering SE-1, 220–232 (1975)

    Article  Google Scholar 

  30. Randell, B., Koutny, M.: Failures: Their definition, modelling and analysis. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 260–274. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  31. Randell, B., Koutny, M.: Structured Occurrence Nets: Incomplete, Contradictory and Uncertain Failure Evidence. TR-1170, School of Computing Science, Newcastle University (2009)

    Google Scholar 

  32. Snow, C.R.: Train Spotting. Newcastle upon Tyne, Computing Laboratory, Newcastle University (1997), http://history.cs.ncl.ac.uk/anniversaries/40th/webbook/trainset/index.html

  33. Wood, W.G.: A Decentralised Recovery Control Protocol. In: Proc. of 11th International Symposium on Fault-Tolerant Computing, pp. 159–164. IEEE Computer Society Press, Los Alamitos (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing Science, Newcastle University, Newcastle upon Tyne, NE1 7RU, United Kingdom

    Brian Randell

Authors
  1. Brian Randell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Bergen University College, Norway

    Lars M. Kristensen

  2. LIPN, CNRS UMR 7030, Université Paris XIII, 99, avenue Jean-Baptiste Clément, F-93430, Villetaneuse, France

    Laure Petrucci

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Randell, B. (2011). Occurrence Nets Then and Now: The Path to Structured Occurrence Nets. In: Kristensen, L.M., Petrucci, L. (eds) Applications and Theory of Petri Nets. PETRI NETS 2011. Lecture Notes in Computer Science, vol 6709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21834-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21834-7_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21833-0

  • Online ISBN: 978-3-642-21834-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation