Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Modeling and Analysis of Timed Systems

FORMATS 2018: Formal Modeling and Analysis of Timed Systems pp 108–124Cite as

On Persistency in Time Petri Nets

  • Conference paper
  • First Online:

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

Abstract

A transition of a (time) Petri net is persistent if once it is enabled, it can never become disabled through occurrences of other transitions until it is fired [5, 15]. It is said to be effect-persistent if it is persistent and its effect (The effect of an enabled transition t in a marking M is defined by the set of transitions newly enabled by firing t.) is not affected by firing other transitions. This paper investigates some sufficient conditions for persistency and effect-persistency of transitions, in the context of time Petri nets (TPNs for short) that depend on the marking and the static/dynamic time information of the model. Then, it shows how to use these sufficient conditions to improve the partial order reduction technique of the TPN model.

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 EPUB and 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

Notes

  1. 1.

    Constraint of the form \(x-y \le c\), where x, y are real-valued variables and c is a rational constant.

  2. 2.

    A simple atomic constraint is an atomic constraint of the form \(x \le c\) or \(-x\le c\), where x is a real-valued variable and c is a rational constant.

  3. 3.

    Here, F is viewed as a set of triangular atomic constraints.

  4. 4.

    The canonical form of \(F'\) is the formula corresponding to the canonical form of its DBM.

  5. 5.

    http://mcc.lip6.fr.

References

  1. Belluomini, W., Myers, C.J.: Timed state space exploration using POSETs. IEEE Tran. Comput.-Aided Des. Integr. Circuits 19(5), 501–520 (2000)

    Article  Google Scholar 

  2. Bengtsson, J.: Clocks, DBMs and states in timed systems. Ph.D. thesis, Department of Information Technology, Uppsala University (2002)

    Google Scholar 

  3. Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: The expressive power of time Petri nets. Theor. Comput. Sci. 474, 1–20 (2013)

    Article  MathSciNet  Google Scholar 

  4. Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of time Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 442–457. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36577-X_33

    Chapter  MATH  Google Scholar 

  5. Best, E., Devillers, R.: Synthesis of persistent systems. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 111–129. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07734-5_7

    Chapter  MATH  Google Scholar 

  6. Boucheneb, H., Barkaoui, K.: Covering steps graphs of time Petri nets. Electron. Notes Theor. Comput. Sci. 239, 155–165 (2009)

    Article  MathSciNet  Google Scholar 

  7. Boucheneb, H., Barkaoui, K.: Stubborn sets for time Petri nets. ACM Trans. Embed. Comput. Syst. (TECS) 14(1), 11:1–11:25 (2015)

    Google Scholar 

  8. Boucheneb, H., Barkaoui, K.: Delay-dependent partial order reduction technique for real time systems. Real-Time Syst. 54(2), 278–306 (2018)

    Article  Google Scholar 

  9. Boucheneb, H., Barkaoui, K., Weslati, K.: Delay-dependent partial order reduction technique for time Petri nets. In: Legay, A., Bozga, M. (eds.) FORMATS 2014. LNCS, vol. 8711, pp. 53–68. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10512-3_5

    Chapter  Google Scholar 

  10. Boucheneb, H., Gardey, G., Roux, O.H.: TCTL model checking of time Petri nets. Log. Comput. 19(6), 1509–1540 (2009)

    Article  MathSciNet  Google Scholar 

  11. Boucheneb, H., Hadjidj, R.: CTL* model checking for time Petri nets. Theor. Comput. Sci. TCS 353(1–3), 208–227 (2006)

    Article  MathSciNet  Google Scholar 

  12. Boucheneb, H., Lime, D., Roux, O.H.: On multi-enabledness in time Petri nets. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 130–149. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38697-8_8

    Chapter  MATH  Google Scholar 

  13. Boucheneb, H., Rakkay, H.: A more efficient time Petri net state space abstraction useful to model checking timed linear properties. Fundam. Inform. 88(4), 469–495 (2008)

    MathSciNet  MATH  Google Scholar 

  14. Boyer, M., Diaz, M.: Multiple-enabledness of transitions in time Petri nets. In: 9th IEEE International Workshop on Petri Nets and Performance Models, pp. 219–228 (2001)

    Google Scholar 

  15. Best, E., Darondeau, P.: Decomposition theorems for bounded persistent Petri nets. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 33–51. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68746-7_7

    Chapter  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  17. Lilius, J.: Efficient state space search for time Petri nets. In: MFCS Workshop on Concurrency Algorithms and Tools, ENTCS, vol. 8, pp. 113–133 (1998)

    Google Scholar 

  18. Lugiez, D., Niebert, P., Zennou, S.: A partial order semantics approach to the clock explosion problem of timed automata. Theor. Comput. Sci. TCS 345(1), 2759 (2005)

    MathSciNet  MATH  Google Scholar 

  19. Yoneda, T., Ryuba, H.: CTL model checking of time Petri nets using geometric regions. EICE Trans. Inf. Syst. E99–D(3), 297–306 (1998)

    Google Scholar 

  20. Yoneda, T., Schlingloff, B.H.: Efficient verification of parallel real-time systems. Form. Methods Syst. Des. 11(2), 187–215 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, 192 rue Saint Martin, Paris Cedex 03, France

    Kamel Barkaoui & Hanifa Boucheneb

  2. Laboratoire VeriForm, Department of Computer Engineering and Software Engineering, École Polytechnique de Montréal, P.O. Box 6079, Station Centre-ville, Montréal, Québec, H3C 3A7, Canada

    Hanifa Boucheneb

Authors
  1. Kamel Barkaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanifa Boucheneb
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hanifa Boucheneb .

Editor information

Editors and Affiliations

  1. Institute of Software, Chinese Academy of Sciences, Beijing, China

    David N. Jansen

  2. Kansas State University, Manhattan, Kansas, USA

    Pavithra Prabhakar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Barkaoui, K., Boucheneb, H. (2018). On Persistency in Time Petri Nets. In: Jansen, D., Prabhakar, P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2018. Lecture Notes in Computer Science(), vol 11022. Springer, Cham. https://doi.org/10.1007/978-3-030-00151-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00151-3_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00150-6

  • Online ISBN: 978-3-030-00151-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation