Skip to main content

Transition systems of Elementary Net Systems with inhibitor arcs

  • Regular Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1997 (ICATPN 1997)

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

Included in the following conference series:

Abstract

We here consider transition systems of Elementary Net Systems with inhibitor arcs. There are basically two different types of non-interleaving semantics of such Petri nets, the a-posteriori and a-priori semantics. The former is an instance of the causal partial order semantics, and can be captured using means similar to those developed for ordinary safe nets. The latter is based on an extension of the partial order semantics which includes weak causality in addition to the standard causality relationship. In this paper we deal only with the a-priori semantics. Our aim is to completely characterise transition systems which can be generated by Elementary Net Systems with inhibitor arcs. This is achieved by adapting the notion of a step transition system, i.e. one in which arcs are labelled by sets of events executed concurrently. In developing our model, we follow the standard approach in which the relationship between nets and their transition systems is established via the notion of a region. We define, and show consistency of, two behaviour preserving translations between nets and transition systems. Our results can be used to provide the basis for an automatic synthesis of nets with inhibitor arcs from operational descriptions expressed in terms of transition systems.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bednarczyk M.A.: Categories of asynchronous systems. Ph.D. Thesis, University of Sussex (1988).

    Google Scholar 

  2. Billington J.: Extensions to coloured nets. Proc. of 3rd Int. Workshop on Petri Nets and Performance Models, Kyoto, Japan (1989), 61–70.

    Google Scholar 

  3. Bernardinello L., De Michelis G., Petruni K., Vigna S.: On the synchronie structure of transition systems. In: J. Desel (Ed.) Structures in Concurrency Theory, Berlin 1995, Workshops in Computing, Springer (1995), 69–84.

    Google Scholar 

  4. Chiola G., Donatelli S., Francheschinis G.: Priorities, inhibitor arcs and concurrency in P/T nets. Proc. of 12th Intern. Conf. on Appl. and Theory of Petri Nets, Gjern, Denmark (1991), 182–205.

    Google Scholar 

  5. Christiansen S., Hansen N.D.: Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs. Proc. of Application and Theory of Petri Nets'93, Lecture Notes in Computer Science 651, Springer (1993), 186–205.

    Google Scholar 

  6. Hoogeboom H.J., Rozenberg G.: Diamond properties of elementary net systems. Fundamenta Informaticae XIV (1991), 287–300.

    Google Scholar 

  7. Janicki R., Koutny M.: Semantics of inhibitor nets. Information and Computation, Vol. 123, No. 1 (1995), 1–16.

    Google Scholar 

  8. Janicki R., Lauer P.E.: Specification and analysis of concurrent systems: the COSY approach. Springer-Verlag, (1992).

    Google Scholar 

  9. Keller R.M.: Formal verification of parallel programs. CACM, Vol. 19, No. 7 (1976), 371–389.

    Google Scholar 

  10. Montanari U., Rossi F.: Contextual nets. Acta Informatica 32 (1995), 545–596.

    Google Scholar 

  11. Mukund M.: Petri nets and step transition systems. International Journal of Foundations of Computer Science, Vol. 3, No. 4 (1992), 443–478.

    Google Scholar 

  12. Nielsen M., Rozenberg G., Thiagarajan P.S.: Elementary transition systems. Theoretical Computer Science 96 (1992), 3–33.

    Google Scholar 

  13. Shields M.W.: Concurrent machines. Computer Journal 28 (1985), 449–465.

    Google Scholar 

  14. Winskel G., Nielsen M.: Models for concurrency. In: S. Abramsky, Dov M. Gabbay and T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 4 (1995), 1–148.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Pierre Azéma Gianfranco Balbo

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pietkiewicz-Koutny, M. (1997). Transition systems of Elementary Net Systems with inhibitor arcs. In: Azéma, P., Balbo, G. (eds) Application and Theory of Petri Nets 1997. ICATPN 1997. Lecture Notes in Computer Science, vol 1248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63139-9_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-63139-9_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69187-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics