Skip to main content
SpringerLink
Log in

Towards a Notion of Distributed Time for Petri Nets

Extended Abstract

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2001 (ICATPN 2001)

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

Included in the following conference series:

Abstract

We set the ground for research on a 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. The novelty is that, rather than a single global clock, we use a set of unrelated clocks — possibly one per place — allowing a local timing as well as distributed time synchronisation. We give a formal definition of the model and investigate properties of local versus global timing, including decidability issues and notions of processes of the respective models.

Author partly supported by MUST project TOSCA.

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

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. A. Abdulla and K. Cerans. Simulation is decidable for onecounter nets. In Proceedings of 9th International Conference on Concurrency Theory (CONCUR’98), volume 1466 of LNCS, pages 253–268, 1998.

    Google Scholar 

  2. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. 5th Symp. on Logic in Computer Science (LICS 90), pages 414–425, 1990.

    Google Scholar 

  3. R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. of Int. Colloquium on Algorithms, Languages and Programming, volume 443 of LNCS, pages 322–335, 1990.

    Google Scholar 

  4. R. Alur and D. Dill. Automata for Modelling Real-Time Systems. Theoretical Computer Science, 126(2):183–236, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  5. P.A. Abdulla and A. Nylen. BQOs and timed Petri nets. In International Conference on Application and Theory of Petri Nets (ICATPN 2001), 2001 http://www.docs. uu.se/~parosh/publications/publications.shtml.

  6. 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 

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

    Google Scholar 

  8. O. Burkart and J. Esparza. More infinite results. Bulletin of the European Association for Theoretical Computer Science, 62:138–159, June 1997. Columns: Concurrency.

    MATH  Google Scholar 

  9. T. Bolognesi, F. Lucidi, and S. Trigila. From timed Petri nets to timed LOTOS. In Proceedings of the IFIP WG 6.1 Tenth International Symposium on Protocol Specification, Testing and Verification (Ottawa 1990), pages 1–14. North-Holland, Amsterdam, 1990.

    Google Scholar 

  10. A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Annual Symposium on Theoretical Aspects of Computer Science (STACS’99), volume 1563 of LNCS, pages 323–333. Springer-Verlag, 1999.

    Google Scholar 

  11. 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/.

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

    MATH  MathSciNet  Google Scholar 

  13. 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 

  14. P. Jancar. Decidability of a temporal logic problem for Petri nets. Theoretical Computer Science, 74(1):71–93, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  15. P. Jancar. Bisimulation equivalence is decidable for one-counter processes. In Automata, Languages and Programming, 24th International Colloquium (ICALP’97), volume 1256 of LNCS, pages 549–559. Springer-Verlag, 1997.

    Google Scholar 

  16. K.G. Larsen, P. Pettersson, and W. Yi. Model-checking for realtime systems. In Proc. of Fundamentals of Computation Theory, number 965 in LNCS, pages 62–88, 1995.

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

  19. T. Meincke, A. Hemani, S. Kumar, P. Ellervee, J. Berg, D. Lindqvist, H. Tenhunen, A. Postula. Evaluating Benefits of Globally Asynchronous Locally Synchronous VLSI Architecture). In Proc. 16th Norchip, pages 50–57, 1998.

    Google Scholar 

  20. F. Moller. Infinite results. In Proceedings of CONCUR’96, volume 1119 of LNCS, pages 195–216. Springer-Verlag, 1996.

    Google Scholar 

  21. C. Ramchandani. Performance Evaluation of Asynchronous Concurrent Systems by Timed Petri Nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, 1973.

    Google Scholar 

  22. V. Valero Ruiz, V. Valero Ruiz, F. Cuartero Gomez, and D. de Frutos Escrig. On non-decidability of reachability for timed-arc Petri nets. In Proceedings of the 8th Int. Workshop on Petri Net and Performance Models (PNPM’99), pages 188–196, 1999.

    Google Scholar 

  23. F. B. Schneider, B. Bloom, and K. Marzullo. Putting time into proof outlines. In Proceedings REX Workshop on Real-Time: Theory in Practice, volume 600 of LNCS, pages 618–639. Springer-Verlag, 1992.

    Chapter  Google Scholar 

  24. J. Sifakis. Use of Petri nets for performance evaluation. In Proceedings of the Third International Symposium IFIP W.G. 7.3., Measuring, modelling and evaluating computer systems (Bonn-Bad Godesberg, 1977), pages 75–93. Elsevier Science Publishers, Amsterdam, 1977.

    Google Scholar 

  25. J. Wang. Timed Petri Nets, Theory and Application. Kluwer Academic Publishers, 1998.

    Google Scholar 

  26. Wang Yi. Real-time behaviour of asynchronous agents. In Proceedings of the International Conference on Concurrency Theory (CONCUR’90), number 458 in LNCS. Springer-Verlag, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Mogens Nielsen

  2. University of Sussex, UK

    Vladimiro Sassone

  3. Dept. of Computer Science, University of Aarhus, DK

    Jiří Srba

Authors
  1. Mogens Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimiro Sassone
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiří Srba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática e Ingeniería de Sistemas Centro Politécnico Superior, Universidad de Zaragoza, María de Luna, 3, 50015, Zaragoza, Spain

    José-Manuel Colom

  2. Department of Computing Science, University of Newcastle upon Tyne, Newcastle upon Tyne, NE1 7RU, UK

    Maciej Koutny

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). Towards a Notion of Distributed Time for Petri Nets. In: Colom, JM., Koutny, M. (eds) Applications and Theory of Petri Nets 2001. ICATPN 2001. Lecture Notes in Computer Science, vol 2075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45740-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45740-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45740-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation