Using inclusion abstraction to construct Atomic State Class Graphs for Time Petri Nets

International Journal of Embedded Systems

Volumn 2, Issue 1-2, 2006, Pages 128-139

  Boucheneb, Hanifa ^a   Hadjidj, Rachid ^a  

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

Author keywords

Atomic State Class Graph (ASCG); CTL* properties; model checking; state class spaces; Strong State Class Graph (SSCG); Time Petri Nets (TPNs)

Indexed keywords

EID: 38149085464     PISSN: 17411068     EISSN: 17411076     Source Type: Journal    
DOI: 10.1504/ijes.2006.010171     Document Type: Article

References (35)

1. Alur, R. and Dill, D. (1990) ‘Automata, languages, and programming’, Paterson, M.S. (Ed.): Lecture Notes in Computer Science 443, Springer-Verlag, ICALP 90, pp.322–335.
2. Andre, C. (1989) Synchronized Elementary Net Systems, Advances in Petri Nets, Grzegorz Rosenberg editor, LNCS 424, Springer-verlag, Berlin, Germany, pp.51–76.
3. Berthomieu, B. (2001) ‘La methode des classes d’etats pour Vanalyse des reseaux temporels – raise en oeuvre, extension a la multi-sensibilisation’, Proc. Modelisation des Systemes Reactifs, Toulouse, France, October, pp.275–290.
4. Berthomieu, B. and Menasche, M. (1983) An Enumerative Approach for Analyzing Time Petri Nets, In IFIP Congress, Elsevier Science Publ. Comp., North Holland, pp.41–46.
5. Berthomieu, B. and Vernadat, F. (2003) ‘State class constructions for branching analysis of time petri nets’, Garavel, H., Hatcliff, J. (Eds.): Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2003), 9th International Conference, Part of ETAPS 2003, Warsaw, Poland, April 711, Vol. 2619, Lecture Notes in Computer Science, February, Springer-Verlag, pp.442–457.
6. Boucheneb, H. and Berthelot, G. (2002) ‘Contraction of the ITCPN state space’, Electronic Notes in Theoretical Computer Science, Vol. 65, June, No. 6, pp.1–15.
7. Boucheneb, H. and Mullins, J. (2003) ‘Analyse de reseaux de Petri temporels. Calculs des classes en O(n2) et destemps de chemin en O(m x n)’, Technique et Science Informatiques, Vol. 22, September, No. 4, pp.435–459.
8. Bucci, G. and Vicario, E. (1995) ‘Compositional validation of time-critical systems using communicating Time Petri Nets’, IEEE Transactions on Software Engineering, Vol. 21, December, No. 12, pp.969–992.
9. Christensen, S., Kritensen, L.M. and Mailand, T. (2001) ‘Condensed state spaces for timed Petri Nets’, Goos, G., Hartmanis, J. and van Leuwen, J. (Eds.): 22nd International Conference on Application And Theory Of Petri Nets, Lecture Notes in Computer Science 2075, Springer, June, pp.101–120
10. Daws, C., Olivero, A., Tripakis, S. and Yovine, S. (1996) ‘The tool Kronos’, Proceedings of the DIMACS/SYCON workshop on Hybrid systems III: verification and control, New Brunswick, New Jersey, United States, pp.208–219.
11. Diaz, M. and Senac, P. (1994) ‘Time stream Petri Nets a model for timed multimedia information’, Valette, R. (Ed): 15th International Conference on Application and Theory of Petri Nets, Zaragosse (Espagne), 22–24 Juin, Lecture Notes in Computer Sciences 815, Springer Verlag, ISBN 3–540-58152–9, pp.219–238.
12. Henzinger, T.A., Ho, P-H. and Wong-Toi, H. (1997) ‘HyTech: a model checker for hybrid systems‘, Software Tools for Technology Transfer, Vol. 1, pp.110–122.
13. Hsiung, P-A. and Wang, F. (1998) ‘A state-graph manipulator tool for real-time system, specification and verification’, Proc. the 5th International Conference on Real-Time Computing Systems and Applications, RTCSA’98, October.
14. Merlin, P. and Farber, D.J. (1976) ‘Recoverability of communication protocols’, IEEE Trans, on Communications, Vol. COM-24, pp.1036–1042.
15. Penczek, W. and Polrola, A. (2001) ‘Abstraction and partial order reductions for checking branching properties of Time Petri Nets’, In Proc. of the Int. Conf. on Applications and Theory of Petri Nets (ICATPN’01), LNCS 2075, Springer-Verlag, pp.323–342.
16. Ramchandani, C. (1974) Analysis of Asynchronous Concurrent Systems by Timed Petri Nets, Project MAC, TR 120, MIT.
17. Rokicki, T.G. (1993) Representing and Modeling Digital Circuits, PhD Thesis, Standford University.Using inclusion abstraction to construct Atomic State Class Graphs for Time Petri Nets
18. Sifakis, J. (1977) ‘Use of Petri Nets for performance evaluation’, in Beilner, H. and Gelenbe, E. (Eds.): Proc. of the 3rd International Symposium IFIP W.G. 7.3., Measuring, Modelling and Evaluating Computer Systems, Elsevier Science Publ., pp.75–93.
19. van der Aalst, W.M.P. (1993) ‘Interval timed coloured Petri Nets and their analysis’, 14th International Conference of Application and Theory of Petri Nets, LNCS 961, Springer, Chicago, pp.453–472.
20. Vicaro, E. (2001) ‘Static analysis and dynamic steering of time-dependent systems’, IEEE Transactions on Software Engineering, Vol. 2, No. 8, August, pp.728–748.
21. Yoneda, T. and Ryuba, H. (1998) ‘CTL model checking of time Petri Nets using geometric regions’, IEICE Trans., Vol. E81-D, No. 3, pp.297–396.
22. Yovine, S. (1993) Methodes et Outils Pour la Verification Symbolique de Systemes Temporises, These de Doctorat, Institut National Polytechnique de Grenoble, France, May.
23. Linear-time Temporal Logic.
24. Computation Tree Logic.
25. The number of its reachable markings is finite.
26. 0 are multi-sets represented by their formal sums.
27. A cover of Σ is a collection of non-empty sets whose union contains Σ.
28. Min(t ∣F) and Max(t ∣F) are respectively the minimal and maximal value of t in the domain represented by F.
29. The normalisation of a state class completes it with all states reachable by time progression.
30. The firing of these transitions can be indefinitely delayed since their maximal firing delays are infinite.
31. Obvious steps are omitted.
32. Bisimilar classes must also share the same marking.
33. Transitions with the same name are synchronised.
34. 2.
35. The number of its reachable markings is finite.