Properties of Distributed Timed-Arc Petri Nets

  • Conference paper
  • First Online:
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001)

Abstract

In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling. This formalism enables to model e.g. hardware architectures like GALS. We give a formal definition of process semantics for our model and investigate several properties of local versus global timing: expressiveness, reachability and coverability.

Author partly supported by MUST project TOSCA.

Author partly supported by the GACR, grant No. 201/00/0400.

Basic Research in Computer Science, Centre of the Danish National Research Foundation.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.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
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 ship** 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. P.A. Abdulla and A. Nylén. Timed Petri nets and BQOs. In Proc. of ICATPN 2001, volume 2075 of LNCS, pages 53–70, 2001.

    Google Scholar 

  2. T. Bolognesi and P. Cremonese. The weakness of some timed models for concurrent systems. Technical Report CNUCE C89-29, CNUCE-C.N.R., 1989.

    Google Scholar 

  3. T. Bolognesi, F. Lucidi, and S. Trigila. From timed Petri nets to timed LOTOS. In Proc. of the IFIP WG 6.1 Tenth International Symposium on Protocol Spec., Testing and Verification, pages 1–14, Amsterdam, 1990.

    Google Scholar 

  4. Fred D.J. Bowden. Modelling time in Petri nets. In Proceedings of the Second Australia-Japan Workshop on Stochastic Models, 1996. http://www.itr.unisa.edu.au/~fbowden/pprs/stomod96/.

  5. M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis, and S. Yovine. Kronos: A model-checking tool for real-time systems. In Proc. of CAV’98, volume 1427 of LNCS, pages 546–550, 1998.

    Google Scholar 

  6. U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Computation, 57:125–147, 1983.

    MATH  MathSciNet  Google Scholar 

  7. H.M. Hanisch. Analysis of place/transition nets with timed-arcs and its application to batch process control. In Application and Theory of Petri Nets, volume 691 of LNCS, pages 282–299, 1993.

    Google Scholar 

  8. S. Hauck. Asynchronous design methodologies: An overview. In Proc. of IEEE, volume 83, pages 69–93, 1995.

    Google Scholar 

  9. K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a Nutshell. Int. Journal on Software Toolsfor Technology Transfer, 1(1–2):134–152, 1997.

    Article  MATH  Google Scholar 

  10. E.W. Mayr. An algorithm for the general Petri net reachability problem (preliminary version). In Proc. of 13th Ann. ACM Symposium on Theory of Computing, pages 238–246. Assoc. for Computing Machinery, 1981.

    Google Scholar 

  11. T. Meincke, A. Hemani, S. Kumar, P. Ellervee, J. Berg, D. Lindqvist, H. Tenhunen, and A. Postula. Evaluating benefits of globally asynchronous locally synchronous VLSI architecture. In Proceedingsof 16th Norchip, pages 50–57, 1998.

    Google Scholar 

  12. M. Nielsen, V. Sassone, and J. Srba. Towards a notion of distributed time for Petri nets. In Proc. of ICATPN 2001, volume 2075 of LNCS, pages 23–31, 2001.

    Google Scholar 

  13. C. Ramchandani. Performance Evaluation of Asynchronous Concurrent Systems by Timed Petri Nets. Ph.D. Thesis, Massachusetts Inst. of Tech., Cambridge, 1973.

    Google Scholar 

  14. V. Valero Ruiz, D. de Frutos Escrig, and O. Marroquin Alosno. Decidability of properties of timed-arc Petri nets. In Proc. of ICATPN 2000, volume 1825 of LNCS, pages 187–206, 2000.

    Google Scholar 

  15. V. Valero Ruiz, F. Cuartero Gomez, and D. de Frutos Escrig. On non-decidability of reachability for timed-arc Petri nets. In Proc. of PNPM’99, pages 188–196, 1999.

    Google Scholar 

  16. J. Sifakis. Use of Petri nets for performance evaluation. In Proc. of the 3rd International Symposium IFIP W.G. 7.3., Measuring, modelling and evaluating computer systems, pages 75–93. Elsevier Science Publ., 1977.

    Google Scholar 

  17. J. Wang. Timed Petri Nets, Theory and Application. Kluwer Acad. Publ., 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nielsen, M., Sassone, V., Srba, J. (2001). Properties of Distributed Timed-Arc Petri Nets. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-45294-X_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Navigation