Efficient reachability analysis for time petri nets

IEEE Transactions on Computers

Volumn 60, Issue 8, 2011, Pages 1085-1099

  Hadjidj, Rachid ^a   Boucheneb, Hanifa ^b  

^a Qatar University   (Qatar)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Formal methods; model checking; reachability properties; state class spaces; time Petri nets (TPN)

Indexed keywords

REACHABILITY; REACHABILITY ANALYSIS; STATE CLASS GRAPH; STATE CLASS SPACES; TIME PETRI NETS;

ABSTRACTING; FORMAL METHODS; MODEL CHECKING;

PETRI NETS;

EID: 79959693007     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2010.195     Document Type: Article

References (26)

1. R. Alur and D.L. Dill, "A Theory of Timed Automata," Theoretical Computer Science, vol. 126, no. 2, pp. 183-235, 1994.
2. F. Balarin, "Approximate Reachability Analysis of Timed Automata," Proc. IEEE Int'l Symp. Real-Time Systems, pp. 52-61, 1996.
3. G. Behrmann, J. Bengtsson, A. David, K.G. Larsen, P. Pettersson, and W. Yi, "Uppaal Implementation Secrets," Proc. Seventh Int'l Symp. Formal Techniques in Real-Time and Fault-Tolerant Systems, pp. 3-22, 2002.
4. R. Bellman, Dynamic Programming, Princeton Univ. Press, 1957.
5. B. Berthomieu and M. Diaz, "Modeling and Verification of Time Dependent Systems Using Time Petri Nets," IEEE Trans. Software Eng., vol. 17, no. 3, pp. 259-273, Mar. 1991.
6. B. Berthomieu and M. Menasche, "An Enumerative Approach for Analyzing Time Petri Nets," Proc. Ninth Int'l Federation of Information Processing (IFIP) World Computer Congress, vol. 9, pp. 41-46, Sept. 1983. (Pubitemid 14559987)
7. B. Berthomieu and F. Vernadat, "State Class Constructions for Branching Analysis of Time Petri Nets," Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS '03), pp. 442- 457, 2003.
8. H. Boucheneb and R. Hadjidj, "Towards Optimal CTL* Model Checking of Time Petri Nets," Proc. Int'l Workshop Discrete Event Systems (WODES '04), pp. 469-474, May 2004.
9. H. Boucheneb and R. Hadjidj, "Using Inclusion Abstraction to Construct Atomic State Class Graphs for Time Petri Nets," Int'l J. Embedded Systems, vol. 2, nos. 1/2, pp. 128-139, 2006.
10. 2) et des Temps de Chemin en o(m × n)," Technique et Science Informatiques, vol. 22, pp. 435-459, 2003.
11. F. Cassez and O.H. Roux, "Structural Translation from Time Petri Nets to Timed Automata," Electronic Notes in Theoretical Computer Science, vol. 128, no. 6, pp. 145-160, 2005. (Pubitemid 40673208)
12. E.M. Clarke, O. Grumberg, and D. Peled, Model Checking. MIT Press, 1999.
13. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed., MIT Press, 2001.
14. G.B. Dantzig and B.C. Eaves, "Fourier-Motzkin Elimination and Its Dual," technical report, Dept. of Operations Research, Stanford Univ. 1972.
15. A. David, "Merging DBMs Efficiently," Proc. 17th Nordic Workshop Programming Theory, pp. 54-56, http://www.diku.dk/NWPT05/, Oct. 2005.
16. D. Dill, "Timing Assumptions and Verification of Finite-State Concurrent Systems," Proc. Workshop Computer Aided Verification Methods for Finite State Systems, vol. 407, pp. 197-212, 1989.
17. G. Gardey, O.H. Roux, and O.F. Roux, "Using Zone Graph Method for Computing the State Space of a Time Petri Net," Proc. Formal Analysis and Modeling of Timed Systems (FORMATS '03), pp. 246-259, 2004. (Pubitemid 39744103)
18. R. Hadjidj and H. Boucheneb, "Zenoness Detection and Times Model Checking for Real Time Systems," Proc. First Int'l Workshop Verification, Evaluation of Computer and Comm. Systems (VECos '07), 2007.
19. K.G. Larsen, C. Weise, W. Yi, and J. Pearson, "Clock Difference Diagrams," Nordic J. Computing, vol. 6, no. 3, pp. 271-298, 1999.
20. P. Merlin and D.J. Farber, "Recoverability of Communication Protocols-Implication of a Theoretical Study," IEEE Trans. Comm., vol. 24, no. 9, pp. 1036-1043, Sept. 1976.
21. Y. Okawa and T. Yoneda, "Symbolic CTL Model Checking of Time Petri Nets," Electronics and Comm. in Japan, vol. 80, no. 4, pp. 11-20, 1997.
22. D. Park, "Concurrency and Automata on Infinite Sequences," Proc. Fifth GI-Conf. Theoretical Computer Science, pp. 167-183, 1981.
23. W. Penczek and A. Polrola, "Abstractions and Partial Order Reductions for Checking Branching Properties of Time Petri Nets," Proc. Int'l Conf. Application and Theory of Petri Nets (ICATPN '01), pp. 323-342, 2001. (Pubitemid 33297944)
24. W. Penczek and A. Polrola, "Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata," Proc. Int'l Conf. Application and Theory of Petri Nets (ICATPN '04), pp. 37-76, 2004.
25. A. Pnueli, "The Temporal Logic of Programs," Proc. 18th Symp. Foundations of Computer Science, pp. 46-57, 1977.
26. C. Ramchandani, "Analysis of Asynchronous Concurrent Systems by Timed Petri Nets," Technical Report MAC-TR-120, Massachusetts Inst. of Technology, Feb. 1974.