Abstract
We consider verification of safety properties for concurrent real-timed systems modelled as timed Petri nets, by performing symbolic forward reachability analysis. We introduce a formalism, called region generators for representing sets of markings of timed Petri nets. Region generators characterize downward closed sets of regions, and provide exact abstractions of sets of reachable states with respect to safety properties. We show that the standard operations needed for performing symbolic reachability analysis are computable for region generators. Since forward reachability analysis is necessarily incomplete, we introduce an acceleration technique to make the procedure terminate more often on practical examples. We have implemented a prototype for analyzing timed Petri nets and used it to verify a parameterized version of Fischer’s protocol and a producer-consumer protocol. We also used the tool to extract finite-state abstractions of these protocols.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy fifo channels. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 305–318. Springer, Heidelberg (1998)
Abdulla, P.A., Čera\(\bar{n}\)s, K., Jonsson, B., Yih-Kuen, T.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation 160, 109–127 (2000)
Alur, R., Dill, D.: Automata for modelling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)
Abdulla, P.A., Deneux, J., Mahata, P., Nylén, A.: Forward reachability analysis of timed petri nets. Technical Report 2003- 056, Dept. of Information Technology, Uppsala University, Sweden (2003), http://user.it.uu.se/~pritha/Papers/tpn.ps
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)
Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 1–12. Springer, Heidelberg (1996)
Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, Springer, Heidelberg (1997)
Bensalem, S., Lakhnech, Y., Owre, S.: Computing abstractions of infinite state systems automatically and compositionally. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 319–331. Springer, Heidelberg (1998)
Bowden, F.D.J.: Modelling time in Petri nets. In: Proc. Second Australian-Japan Workshop on Stochastic Models (1996)
Cleaveland, R., Parrow, J., Steffen, B.: A semantics-based tool for the verification of finite-state systems. In: Brinksma, Scollo, Vissers (eds.) Protocol Specification, Testing, and Verification IX, pp. 287–302. North-Holland, Amsterdam (1989)
Delzanno, G., Raskin, J.F.: Symbolic representation of upward-closed sets. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 426–440. Springer, Heidelberg (2000)
Finkel, A., Purushothaman Iyer, S., Sutre, G.: Well-abstracted transition systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 566–580. Springer, Heidelberg (2000)
Finkel, A., Raskin, J.-F., Samuelides, M., Van Begin, L.: Monotonic extensions of petri nets: Forward and backward search revisited. In: Proc. Infinity 2002 (2002)
Godskesen, J.C.: Timed Modal Specifications. PhD thesis, Aalborg University (1994)
Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and Systems Sciences 3(2), 147–195 (1969)
Lakhnech, Y., Bensalem, S., Berezin, S., Owre, S.: Symbolic techniques for parametric reasoning about counter and clock systems. In: Proc. TACAS 2001. LNCS, vol. 2031 (2001)
Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Software Tools for Technology Transfer 1(1-2) (1997)
Mayr, R.: Undecidable problems in unreliable computations. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, Springer, Heidelberg (2000)
Nielson, M., Sassone, V., Srba, J.: Towards a distributed time for petri nets. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 23–31. Springer, Heidelberg (2001)
Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. LICS 1986, June 1986, pp. 332–344 (1986)
Yovine, S.: Kronos: A verification tool for real-time systems. Journal of Software Tools for Technology Transfer 1(1-2) (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdulla, P.A., Deneux, J., Mahata, P., Nylén, A. (2004). Forward Reachability Analysis of Timed Petri Nets. In: Lakhnech, Y., Yovine, S. (eds) Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems. FTRTFT FORMATS 2004 2004. Lecture Notes in Computer Science, vol 3253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30206-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30206-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23167-7
Online ISBN: 978-3-540-30206-3
eBook Packages: Springer Book Archive