Skip to main content

Behaviour of Elementary Net Systems

  • Conference paper

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

Abstract

We consider two ways of recording the behaviour of an elementary net system (EN system): via sequential observations and via non-sequential observations. In the sequential point of view each record of the behaviour of an EN system is a string of event occurrences (called a firing sequence) as registered by a sequential observer. In the nonsequential point of view we can define the behaviour of an EN system by either extracting causal order of events from firing sequences (obtaining firing traces) or by recording all nonsequential observations of event occurrences and of resulting holdings of conditions (each such record is called a process). In our contribution we discuss each of the three approaches and then relate them to each other.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. IJ. J. Aalbersberg and G. Rozenberg, Theory of traces, Institute of Applied Mathematics and Computer Science, University of Leiden, Techn. Rep. No. 86-16 (1986).

    Google Scholar 

  2. E. Best, A theorem on characteristics of non-sequential processes, Fundamenta Informatica III. 1 (1980), pp. 77–94.

    MathSciNet  Google Scholar 

  3. E. Best and C. Fernandez, Concurrent systems and processes, GMD Internal Report (1985).

    Google Scholar 

  4. A. Ehrenfeucht and G. Rozenberg, On the structure of dependency graphs, Computer Science Department, University of Colorado at Boulder, Boulder, Colorado, USA, Tech. Rep. No. CU-CS-329-86 (1986).

    Google Scholar 

  5. C. Fernandez and P. S. Thiagarajan, D-continuous causal nets: a model of nonsequential processes, Theoretical Computer Science 28 (1984), pp. 171–196.

    Article  MathSciNet  MATH  Google Scholar 

  6. U. Goltz and W. Reisig, The non-sequential behaviour of Petri nets, Information and Control 57 (1983), pp. 125–147.

    Article  MathSciNet  MATH  Google Scholar 

  7. M. H. T. Hack, Petri net languages, Computation Structures Group Memo 124, Project MAC, M. I. T., Cambridge, Massachusetts, USA (1976).

    Google Scholar 

  8. M. Jantzen, On the hierarchy of Petri net languages, RAIRO Theoretical Informatics 19 (1979), pp. 19–30.

    MathSciNet  Google Scholar 

  9. M. Jantzen and R. Valk, Formal properties of Place/Transition systems, Lecture Notes in Computer Science 84 (1980)

    Google Scholar 

  10. A. Mazurkiewicz, Concurrent program schemes and their interpretation, Computer Science Deparatment, Aarhus University, Aarhus, Denmark, Techn. Rep. No. PB-78 (1978).

    Google Scholar 

  11. A. Mazurkiewicz, Semantics of concurrent systems: a modular fixed-point trace approach, Lecture Notes in Computer Science 188 (1984), pp. 353–375.

    Article  MathSciNet  Google Scholar 

  12. M. Nielsen, G. Plotkin and G. Winskel, Petri nets, event structures and domains, Part I, Theoretical Computer Science 13 (1981), pp. 85–108.

    Article  MathSciNet  MATH  Google Scholar 

  13. J. L. Peterson, Computation sequence sets, Journal of Computer and System Sciences 13 (1976), pp. 1–24.

    Article  MathSciNet  MATH  Google Scholar 

  14. C. A. Petri, Non-sequential processes, GMD, St. Augustin, W. Germany, Internal Report GMD-ISF-77. 5 (1977).

    Google Scholar 

  15. W. Reisig, Petri nets: An Introduction, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Heidelberg (1985).

    MATH  Google Scholar 

  16. G. Rozenberg and P. S. Thiagarajan, Petri nets: basic notions, structure, behaviour, Lecture Notes in Computer Science 224 (1986), pp. 585–668.

    Article  MathSciNet  Google Scholar 

  17. G. Rozenberg and R. Verraedt, Subsets languages of Petri nets, Part I, Theoretical Computer Science 26 (1983), pp. 301–326.

    Article  MathSciNet  MATH  Google Scholar 

  18. P. Starke, Free Petri net languages, Lecture Notes in Computer Science 64 (1978), pp. 506–515.

    Article  MathSciNet  Google Scholar 

  19. P. Starke, Processes in Petri net, Electronische Informationsverarbeitung und Kybernetik 17 (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rozenberg, G. (1987). Behaviour of Elementary Net Systems. In: Brauer, W., Reisig, W., Rozenberg, G. (eds) Petri Nets: Central Models and Their Properties. ACPN 1986. Lecture Notes in Computer Science, vol 254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47919-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-47919-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17905-4

  • Online ISBN: 978-3-540-47919-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics