Abstract
We consider here the interval timed coloured Petri net model (ITCPN). This model associates with each created token a time interval specifying when the token will become available and forces enabled transitions to occur as soon as possible. This model can simulate other timed Petri nets and allows to describe large and complex real-time systems. We propose a much more efficient contraction for its generally infinite state space than those developed in the literature. Our contraction approach captures all linear properties of the model and produces finite graphs for all bounded models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alur R, Dill D (1990) Automata for modeling real-time systems 17me ICALP, LNCS 443. Springer, Heidelberg, pp 322–335
Alur R, Courcoubetis C, Dill D (1993) Model checking in dense real-time. Inf Comput 104(1):2–34
Bengtsson J (2002) Clocks, DBMs and states in timed systems. PhD thesis, Department of Information Technology, Uppsala University
Behrmann G, Bengtsson J, David A, Larsen KG, Pettersson P, Yi W (2002) UPPAAL implementation secrets. In: 7th international symposium on formal techniques in real-time and fault-tolerant systems, LNCS 2469. Springer, Heidelberg, pp 3–22
Berthomieu B, Diaz M (1991) Modeling and verification of time dependent systems using time Petri nets. IEEE Trans Softw Eng 17(33):259–273, 275–290
Boucheneb H, Berthelot G (2002) Contraction of the ITCPN state space. Theor Comput Sci 65(6):1–15
Berthelot G, Boucheneb H (1994) Occurrence graphs for interval timed coloured nets. In: 15th international conference on application and theory of Petri nets, Zaragoza (Spain), LNCS 815. Springer, Heidelberg
Christensen S, Kritensen LM, Mailand T (2001) Condensed state spaces for timed Petri nets. In: 22nd international conference on application and theory of Petri nets and 2nd international conference on application of concurrency to system design, Newcastle Upon Tyne
Daws C, Olivero A, Tripakis S, Yovine S (1996) The tool Kronos. Hybrid Systems III, Verification and Control, LNCS 1066. Springer, Heidelberg
Diaz M, Senac P (1994) Time stream Petri nets a model for timed multimedia information. In: 15th international conference on application and theory of Petri nets, LNCS 815. Springer, Zaragoza (Spain)
Henzinger TA, Ho PH, Wong-Toi H (1997) HyTech: a model checker for hybrid systems. Softw Tools Technol Transf 1:110–122
Hsiung PA, Gau CH (2002) Formal synthesis of real-time embedded software by time-memory scheduling of colored time Petri nets. Theor Comput Sci 65(6):140–153
Jensen K (1982) Coloured Petri nets: basic concepts, analysis methods and practical use, vols 1 and 2, EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg
Merlin P, Farber DJ (1976) Recoverability of communication protocols. IEEE Trans Commun 24: 1036–1042
Sifakis J (1977) In: Beilner H, Gelenbe E (eds) Use of Petri nets for performance evaluation, measuring, modeling and evaluating computer systems. North-Holland, Amsterdam
Thanh CB, Klaudel H, Pommereau F (2002) Petri nets with causal time for system verification. In: 3rd international workshop on models for time-critical systems
Van der Aalst WMP (1993) Interval timed coloured Petri nets and their analysis. In: 14th international conference of application and theory of Petri nets, Chicago
Vicaro E (2001) Static analysis and dynamic steering of time-dependent systems. IEEE Trans Softw Eng 2(8):728–748
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Boucheneb, H. Interval timed coloured Petri net: efficient construction of its state class space preserving linear properties. Form Asp Comp 20, 225–238 (2008). https://doi.org/10.1007/s00165-007-0050-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-007-0050-7