Skip to main content

Event Structures for the Collective Tokens Philosophy of Inhibitor Nets

  • Conference paper
Mathematical Foundations of Computer Science 2005 (MFCS 2005)

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

  • 1353 Accesses

Abstract

In recent years the collective tokens philosophy for Petri Nets has gained again the stage, but it is commonly set in opposition to the individual tokens philosophy. In this paper we investigate what can be an adequate event structures to capture the collective tokens philosophy of nets when inhibitor arcs are taken into account.

Work partially supported by the SYBILLA progetto “Systems Biology: modellazione, linguaggi e analisi”.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures and processes. Information and Computation 171, 1–49 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Busi, N., Pinna, G.M.: Process semantics for Place/Transition nets with inhibitor and read arcs. Fundamenta Informaticae 40, 165–197 (1999)

    MATH  MathSciNet  Google Scholar 

  3. Degano, P., Priami, C.: Causality for mobile processes. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 660–671. Springer, Heidelberg (1995)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Pinna, G.M., Poigné, A.: On the nature of events. In: Havel, I.M., Koubek, V. (eds.) MFCS 1992. LNCS, vol. 629, pp. 430–441. Springer, Heidelberg (1992)

    Google Scholar 

  6. Baldan, P.: Modelling concurrent computations: from contextual Petri nets to graph grammars. PhD thesis, University of Pisa (2000)

    Google Scholar 

  7. Busi, N., Pinna, G.: Contextual event structure and Petri nets with read and inhibitor arcs. manuscript (1999)

    Google Scholar 

  8. Glabbeek, R.J.v., Plotkin, G.D.: Configuration structures. In: Kozen, D. (ed.) Proceedings of 10th Annual IEEE Symposium on Logic in Computer Science, pp. 199–209. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  9. Pinna, G.M., Poigné, A.: On the nature of events: another perspective in concurrency. Theoretical Computer Science 138, 425–454 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structure semantics for general Petri nets. Theoretical Computer Science 153, 129–170 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: A comparison of petri net semantics under the collective token philosophy. In: Hsiang, J., Ohori, A. (eds.) ASIAN 1998. LNCS, vol. 1538, pp. 225–244. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Baldan, P., Busi, N., Corradini, A., Pinna, G.: Domain and event structure semantics for Petri nets with read and inhibitor arcs. Theoretical Computer Science 323, 129–189 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. van Glabbeek, R.J., Plotkin, G.: Event structures for resolvable conflict. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 550–561. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Gunawardena, J.: A generalized event structure for the muller unfolding of a safe net. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, Springer, Heidelberg (1993)

    Google Scholar 

  15. Pinna, G.: Event structures with disabling/enabling relation and event automata (2005) (submitted)

    Google Scholar 

  16. Winskel, G.: Event Structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Langerak, R.: Transformation and Semantics for LOTOS. PhD thesis, University of Twente (1992)

    Google Scholar 

  19. Boudol, G.: Flow Event Structures and Flow Nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 62–95. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinna, G.M. (2005). Event Structures for the Collective Tokens Philosophy of Inhibitor Nets. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_62

Download citation

  • DOI: https://doi.org/10.1007/11549345_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28702-5

  • Online ISBN: 978-3-540-31867-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics