Skip to main content

Petri Nets Are (Not Only) Distributed Automata

  • Chapter
  • First Online:
Carl Adam Petri: Ideas, Personality, Impact
  • 469 Accesses

Abstract

It is not uncommon that the simplicity of a scientist’s proposal is used by some people to undervalue its goals, with the argument that anybody would have finally proposed such an “obvious” theory. The author has the impression that Carl Adam Petri was sometimes treated in this way, possibly because he preferred to concentrate on the conceptually essential aspects of his developments.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. O. Marroquín-Alonso, D. de Frutos-Escrig, Extending the Petri box calculus with time, in Application and Theory of Petri Nets 2001, 22nd International Conference, ICATPN 2001, ed. by J.M. Colom, M. Koutng. Lecture Notes in Computer Science, vol. 2075 (Springer, Berlin, 2001), pp. 303–322

    Chapter  Google Scholar 

  2. E. Best, R. Devillers, M. Koutny, Petri Net Algebra (Springer, Berlin, 2001)

    Book  Google Scholar 

  3. L. Cardelli, Abstraction for mobile computation, in Secure Internet Programming, Security Issues for Mobile and Distributed Objects, ed. by J. Vitek, C.D. Jensen. Lecture Notes in Computer Science, vol. 1603 (Springer, Berlin, 1999), pp. 51–94

    Chapter  Google Scholar 

  4. D. de Frutos-Escrig, Decidability of home states in place transition systems. Technical report, Dpto. Informática y Automática. Univ. Complutense de Madrid (1986)

    Google Scholar 

  5. D. de Frutos-Escrig, O. Marroquín-Alonso, Ambient Petri nets. Electron. Notes Theor. Comput. Sci. 85(1), 39 (2003)

    Google Scholar 

  6. D. de Frutos-Escrig, C. Johnen, Decidability of home space property. Technical report, Laboratoire de Recherche en Informatique. Univ. de Paris-Sud, Centre d’Orsay, Report LRI-503 (1989)

    Google Scholar 

  7. D. de Frutos-Escrig, V. Valero-Ruiz, O. Marroquín-Alonso, Decidability of properties of timed-arc Petri nets, in Application and Theory of Petri Nets 2000, 21st International Conference, ICATPN 2000, ed. by M. Nielsen, D. Simpson. Lecture Notes in Computer Science, vol. 1825 (Springer, Berlin, 2000), pp. 187–206

    Google Scholar 

  8. W.H.J. Feijen, A.J.M. van Gasteren, D. Gries, J. Misra, Beauty Is Our Business: A Birthday Salute to Edsger W. Dijkstra (Springer, Berlin, 2011)

    Google Scholar 

  9. C.A.R. Hoare, The emperor’s old clothes. Commun. ACM 24(2), 75–83 (1981)

    Article  Google Scholar 

  10. K. Jensen, L.M. Kristensen, Coloured Petri Nets: Modelling and Validation of Concurrent Systems (Springer, Berlin, 2009)

    Book  Google Scholar 

  11. R.M. Karp, R.E. Miller, Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147–195 (1969)

    Article  MathSciNet  Google Scholar 

  12. H. Macià, V. Valero-Ruiz, F. Cuartero, D. de Frutos-Escrig, A congruence relation for sPBC. Formal Methods Syst. Des. 32(2), 85–128 (2008)

    Article  Google Scholar 

  13. F. Rosa-Velardo, D. de Frutos-Escrig, Name creation vs. replication in Petri net systems. Fundam. Inform. 88(3), 329–356 (2008)

    Google Scholar 

  14. F. Rosa-Velardo, D. de Frutos-Escrig, Decidability problems in Petri nets with names and replication. Fundam. Inform. 105(3), 291–317 (2010)

    MathSciNet  MATH  Google Scholar 

  15. V. Valero-Ruiz, D. de Frutos-Escrig, F. Cuartero, Simulation of timed Petri nets by ordinary Petri nets and applications to decidability of the timed reachability problem and other related problems, in Proceedings of 4th International Workshop on Petri Nets and Performance Models, PNPM 1991 (IEEE, Los Alamitos, 1991), pp. 154–163

    Google Scholar 

  16. V. Valero-Ruiz, D. de Frutos-Escrig, F. Cuartero, On non-decidability of reachability for timed-arc Petri nets, in Proceedings of 8th International Workshop on Petri Nets and Performance Models, PNPM 1999 (IEEE Computer Society, Los Alamitos, 1999), pp. 188–196

    Google Scholar 

  17. E. Smith, Carl Adam Petri: Life and Science (Springer, Berlin, 2015)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to David de Frutos Escrig .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

de Frutos Escrig, D. (2019). Petri Nets Are (Not Only) Distributed Automata. In: Reisig, W., Rozenberg, G. (eds) Carl Adam Petri: Ideas, Personality, Impact. Springer, Cham. https://doi.org/10.1007/978-3-319-96154-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-96154-5_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-96153-8

  • Online ISBN: 978-3-319-96154-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics