Skip to main content
SpringerLink
Log in

Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs

  • Conference paper
Book cover Formal Modeling and Analysis of Timed Systems (FORMATS 2008)

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

Abstract

We consider here time Petri nets (the TPN model) and two of its state space abstractions: the state class graph (SCG) and the zone based graph (ZBG). We show that only some time points of the clock/firing domains of abstract states are relevant to construct a TPN reachability graph. Moreover, for the state class graph method, the graph computed using relevant time points is smaller than the SCG.

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. Behrmann, G., Bouyer, P., Larsen, K.G., Pelànek, R.: Lower and upper bounds in zone-based abstractions of timed automata. International Journal on Software Tools for Technology Transfer 8(3), 204–215 (2006)

    Article  Google Scholar 

  2. Bengtsson, J.: Clocks, DBMs and States in Timed Systems, PhD thesis, Dept. of Information Technology, Uppsala University (2002)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Boucheneb, H., Rakkay, H.: A more efficient time Petri net state space abstraction preserving linear properties. In: Proc. of the seventh International Conference on Application of Concurrency to System Design (ASCD 2007), pp. 61–70. IEEE Computer Society, Los Alamitos (2007)

    Chapter  Google Scholar 

  5. Boucheneb, H., Hadjidj, R.: CTL* model checking for time Petri nets. Journal of Theoretical Computer Science TCS 353(1-3), 208–227 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gardey, G., Roux, O.H., Roux, O.F.: State space computation and analysis of time Petri nets. Theory and Practice of Logic Programming (TPLP), Special Issue on Specification Analysis and Verification of Reactive Systems 6(3), 301–320 (2006)

    MATH  MathSciNet  Google Scholar 

  7. Boucheneb, H., Gardey, G., Roux, O.H.: TCTL model checking of time Petri nets, Technical Report IRCCyN number RI 2006-14 (2006)

    Google Scholar 

  8. Penczek, W., Pólrola, A.: Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 37–76. Springer, Heidelberg (2004)

    Google Scholar 

  9. Popova-Zeugmann, L., Schlatter, D.: Analyzing paths in time Petri nets. Fundamenta Innformaticae 37, 311–327 (1999)

    MATH  MathSciNet  Google Scholar 

  10. Yoneda, T., Schlingloff, B.H.: Efficient Verification of Parallel Real-Time Systems. Formal Methods in System Design 11(2), 187–215 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Hanifa Boucheneb

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

    Kamel Barkaoui

Authors
  1. Hanifa Boucheneb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamel Barkaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franck Cassez Claude Jard

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boucheneb, H., Barkaoui, K. (2008). Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs. In: Cassez, F., Jard, C. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2008. Lecture Notes in Computer Science, vol 5215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85778-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85778-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85777-8

  • Online ISBN: 978-3-540-85778-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation