State space abstractions for time petri nets

Handbook of Real-Time and Embedded Systems

Volumn , Issue , 2007, Pages 30-1-30-20

  Berthomieu, Bernard ^a   Vernadat, François ^a  

^a LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055790024     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (32)

1. R. Alur, C. Courcoubetis, N. Halbwachs, D. L. Dill, and H. Wong-Toi. Minimization of timed transition systems. In CONCUR 92: Theories of Concurrency, LNCS 630, Springer, Berlin, pp. 340-354, 1996.
2. B. Berthomieu. La méthode des classes d’états pour l’analyse des réseaux temporels—mise en oeuvre, extension la multi-sensibilisation. In Modélisation des Systèmes Réactifs, Hermes, France, 2001.
3. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering, 17(3): 259-273, 1991.
4. B. Berthomieu, D. Lime, O. H. Roux, and F. Vernadat. Reachability problems and abstract state spaces for time Petri nets with stopwatches. Journal of Discrete Event Dynamic Systems, 2007 (to appear).
5. B. Berthomieu and M. Menasche. An enumerative approach for analyzing time Petri nets. IFIP Congress Series, 9: 41-46, 1983.
6. B. Berthomieu, F. Peres, and F. Vernadat. Bridging the gap between timed automata and bounded time Petri nets. In 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), LNCS 4202, Springer, Berlin, 2006.
7. B. Berthomieu, P. -O. Ribet, and F. Vernadat. The tool TINA—construction of abstract state spaces for Petri nets and time Petri nets. International Journal of Production Research, 42(14): 2741-2756, 2004.
8. B. Berthomieu and F. Vernadat. State class constructions for branching analysis of time Petri nets. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS’2003), Warsaw, Poland, LNCS 2619, Springer, Berlin, pp. 442-457, 2003.
9. H. Boucheneb and R. Hadjidj. Towards optimal CTL∗ model checking of time Petri nets. In Proceedings of 7thWorkshop on Discrete Events Systems, Reims, France, September 2004.
10. H. Boucheneb and J. Mullins. Analyse des réseaux temporels: Calcul des classes en o(n[2]) et des temps de chemin en o(mn). Technique et Science Informatiques, 22: 435-459, 2003.
11. G. Bucci, A. Fedeli, L. Sassoli, and E. Vicario. Timed state space analysis of real-time preemptive systems. IEEE Transactions on Software Engineering, 30(2): 97-111, 2004.
12. G. Bucci and E. Vicario. compositional validation of time-critical systems using communicating time Petri nets. IEEE Transactions on Software Engineering, 21(12): 969-992, 1995.
13. F. Cassez and O. H. Roux. Structural translation from time Petri nets to timed automata. Journal of Systems and Software, 2006. (forthcoming).
14. G. Gardey, D. Lime, M. Magnin, and O. H. Roux. Roméo: A tool for analyzing time Petri nets. In 17th International Conference on Computer Aided Verification, LNCS 3576, Springer, Berlin, July 2005.
15. R. Hadjidj. Analyse et validation formelle des systèmes temps réel. PhD Thesis, Ecole Polytechnique de Montréal, Université de Montréal, February 2006.
16. N. D. Jones, L. H. Landweber, and Y. E. Lien. complexity of some problems in Petri nets. Theoretical Computer Science, 4, 277-299, 1977.
17. P. K. Kanellakis and S. A. Smolka. CCSexpressions, finite state processes, and three problems of equivalence newblock. Information and Computation, 86: 43-68, 1990.
18. D. Lime and O. H. Roux. Expressiveness and analysis of scheduling extended time Petri nets. In 5th IFAC International Conference on Fieldbus Systems and their Applications, Aveiro, Portugal, Elsevier Science, pp. 193-202, July 2003.
19. P. M. Merlin. A Study of the Recoverability of Computing Systems. PhD Thesis, University of California, Irvine, 1974.
20. P. M. Merlin and D. J. Farber. Recoverability of communication protocols: Implications of a theoretical study. IEEE Trans. communication, 24(9): 1036-1043, 1976.
21. P. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6): 973-989, 1987.
22. W. Penczek and A. Półrola. Abstraction and partial order reductions for checking branching properties of time Petri nets. In Proceedings of the 22st International Conference on Application and Theory of Petri Nets (ICATPN 2001), LNCS 2075, Springer, Berlin, pp. 323-342, 2001.
23. W. Penczek and A. Półrola. Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. Studies in Computational Intelligence, Vol. 20, Springer, Berlin, 2006.
24. L. Popova. On time Petri nets. Journal of Information Processing and Cybernetics EIK, 27(4): 227-244, 1991.
25. L. Popova and D. Schlatter. Analyzing paths in time Petri nets. Fundamenta Informaticae, 37(3): 311-327, 1999.
26. T. G. Rokicki. Representing and Modeling Circuits. PhD Thesis, Stanford University, Stanford, CA, 1993.
27. T. G. Rokicki and C. J. Myers. Automatic verification of timed circuits. In 6th Conference Computer Aided Verification, CAV’94, LNCS 818, Springer, Berlin, pp. 468-480, June 1994.
28. P. H. Starke. Ina—Integrated Net Analyzer, Reference Manual. Technical report, Humboldt Institute of Informatics, Berlin, 1997.
29. E. Vicario. Static analysis and dynamic steering of time-dependent systems. IEEE Transactions on Software Engineering, 27(8): 728-748, 2001.
30. I. Virbitskaite and E. Pokozy. A partial order method for the verification of time petri nets. In Fundamentals of Computation Theory: 12th International Symposium (FCT’99), Iasi, Romania, LNCS 1684, Springer, Berlin, pp. 547-558, 1999.
31. T. Yoneda and H. Ryuba. CTL model checking of time Petri nets using geometric regions. IEEE Transactions on Information and Systems, E99-D(3): 1-10, 1998.
32. T. Yoneda, A. Shibayama, B. -H. Schlingloff, and E. M. Clarke. Efficient verification of parallel real-time systems. In 5th Conference on Computer Aided Verification, LNCS 697, Springer, Berlin, pp. 321-332, June 1993.