Skip to main content
SpringerLink
Log in
Book cover

International Conference on Applications and Theory of Petri Nets and Concurrency

PETRI NETS 2014: Application and Theory of Petri Nets and Concurrency pp 294–313Cite as

Dynamic Networks of Timed Petri Nets

  • Conference paper

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

Abstract

We study dynamic networks of infinite-state timed processes, modelled as unbounded Petri nets. These processes can evolve autono-mously, synchronize with each other (e.g., in order to gain access to some shared resources) and be created or become garbage dynamically. We introduce dense time in two different ways. First, we consider that each token in each process carries a real valued clock. We prove that this model can faithfully simulate Turing-complete formalisms and, in particular, safety properties are undecidable for them. Second, we consider locally-timed processes, where each process carries a single real valued clock. For them, we prove decidability of safety properties by a non-trivial instantiation of the framework of Well-Structured Transition Systems.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1-2), 109–127 (2000)

    Article  MathSciNet  Google Scholar 

  2. Abdulla, P.A., Deneux, J., Mahata, P., Nylén, A.: Forward reachability analysis of timed Petri nets. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS/FTRTFT 2004. LNCS, vol. 3253, pp. 343–362. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes (Extended abstract). In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 298–312. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Abdulla, P.A., Mahata, P., Mayr, R.: Dense-timed Petri nets: Checking zenoness, token liveness and boundedness. Logical Methods in Computer Science 3(1) (2007)

    Google Scholar 

  5. Abdulla, P.A., Nylén, A.: Timed Petri Nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53–70. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Alur, R., Courcoubetis, C., Henzinger, T.A.: The observational power of clocks. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 162–177. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  7. Bashkin, V.A., Lomazova, I.A., Novikova, Y.A.: Timed resource driven automata nets for distributed real-time systems modelling. In: Malyshkin, V. (ed.) PaCT 2013. LNCS, vol. 7979, pp. 13–25. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Boyer, M., Roux, O.H.: On the compared expressiveness of arc, place and transition time Petri nets. Fundam. Inform. 88(3), 225–249 (2008)

    MathSciNet  MATH  Google Scholar 

  9. de Frutos Escrig, D., Ruiz, V.V., Marroquín Alonso, O.: Decidability of properties of timed-arc Petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 187–206. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63–92 (2001)

    Article  MathSciNet  Google Scholar 

  11. Geeraerts, G., Heussner, A., Praveen, M., Raskin, J.-F.: ω-petri nets. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 49–69. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  12. Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In: LICS, pp. 355–364. IEEE (2012)

    Google Scholar 

  13. Higman, G.: Ordering by Divisibility in Abstract Algebras. Proc. London Math. Soc. s3-2(1), 326–336 (1952)

    Article  MathSciNet  Google Scholar 

  14. Kleijn, J., Koutny, M.: Localities in systems with a/sync communication. Theoretical Computer Science 429, 185 (2012)

    Article  MathSciNet  Google Scholar 

  15. Lazic, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Inform. 88(3), 251–274 (2008)

    MathSciNet  MATH  Google Scholar 

  16. Martos-Salgado, M., Rosa-Velardo, F.: Dynamic networks of timed Petri nets. Technical Report 9/13, DSIC Universidad Complutense de Madrid (2013), http://antares.sip.ucm.es/~frosa/

  17. Martos-Salgado, M., Rosa-Velardo, F.: Expressiveness of dynamic networks of timed petri nets. In: Dediu, A.-H., Martín-Vide, C., Sierra-Rodríguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 516–527. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  18. Merlin, P., Farber, D.: Recoverability of communication protocols–implications of a theoretical study. IEEE Transactions on Comm. 24(9), 1036–1043 (1976)

    Article  MathSciNet  Google Scholar 

  19. Pezzè, M.: Time Petri nets. In: Proceedings of the Multi-Workshop on Formal Methods in Performance Evaluation and Applications (1999)

    Google Scholar 

  20. Ramchandani, C.: Analysis of asynchronous concurrent systems by timed Petri nets. Technical report, Cambridge, MA, USA (1974)

    Google Scholar 

  21. Razouk, R.R., Phelps, C.V.: Performance analysis using timed Petri nets. In: Yemini, Y., Strom, R.E., Yemini, S. (eds.) PSTV, pp. 561–576. North-Holland (1984)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  23. Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci. 412(34), 4439–4451 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sistemas Informáticos y Computación, Universidad Complutense de Madrid, Spain

    María Martos-Salgado & Fernando Rosa-Velardo

Authors
  1. María Martos-Salgado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fernando Rosa-Velardo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Iowa State University, 226 Atanasoff Hall, 50011, Ames, IA, USA

    Gianfranco Ciardo

  2. DTU Compute, Technical University of Denmark, Richard Pedersens Plads, 2800 Kgs., Lyngby, Denmark

    Ekkart Kindler

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martos-Salgado, M., Rosa-Velardo, F. (2014). Dynamic Networks of Timed Petri Nets. In: Ciardo, G., Kindler, E. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2014. Lecture Notes in Computer Science, vol 8489. Springer, Cham. https://doi.org/10.1007/978-3-319-07734-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07734-5_16

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation