Model checking bounded prioritized time Petri Nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4762 LNCS, Issue , 2007, Pages 523-532

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

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; MODEL CHECKING; STATE SPACE METHODS;

BOUNDED PRIORITIZED TIME PETRI NETS; STATE SPACE ABSTRACTIONS; TIME PETRI NETS; TIMED AUTOMATA;

PETRI NETS;

EID: 38149099204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75596-8_37     Document Type: Conference Paper

References (16)

1. Alur, R., Courcoubetis, C., Halbwachs, N., Dili, D.L., Wong-Toi, H.: Minimization of timed transition systems. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 340-354. Springer, Heidelberg (1992)
2. Bérard, B., Cassez, F., Haddad, S., Roux, O.H., Lime, D.: Comparison of the Expressiveness of Timed Automata and Time Petri Nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 211-225. Springer, Heidelberg (2005)
3. Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE Tr. on Soft. Eng. 17(3), 259-273 (1991)
4. Boucheneb, H., Hadjidj, R.: Using inclusion abstraction to construct atomic state class graphs for time petri nets. International Journal of Embedded Systems 2(1/2) (June 2006)
5. Berthomieu, B., Menasche, M.: An enumerative approach for analyzing time Petri nets. IFIP Congress Series 9, 41-46 (1983)
6. Berthomieu, B., Peres, F., Vernadat, F.: Bridging the gap between timed automata and bounded time petri nets. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 82-97. Springer, Heidelberg (2006)
7. Berthomieu, B., Ribet, P.-O., Vernadat, F.: 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. Berthomieu, B., Vernadat, F.: State class constructions for branching analysis of time Petri nets. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 442-457. Springer, Heidelberg (2003)
9. Berthomieu, B., Vernadat, F.: State Space Abstractions for Time Petri Nets. In: Lee, I., Leung, J.Y.T., Son, S. (eds.) Handbook of Real-Time and Embedded Systems, CRC Press, Boca Raton (2007)
10. David, A., Håkansson, J., Larsen, K.G., Pettersson, P.: Model checking timed automata with priorities using DBM subtraction. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 128-142. Springer, Heidelberg (2006)
11. Goessler, G., Sifakis, J.: Priority systems. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2003. LNCS, vol. 3188, pp. 314-329. Springer, Heidelberg (2004)
12. Hadjidj, R.: Analyse et validation formelle des systèmes temps réel. PhD Thesis, Ecole Polytechnique de Montréal, Univ. de Montréal (February 2006)
13. Lin, S.-W., Hsiung, P.-A., Huang, C.-H., Chen, Y.-R.: Model checking prioritized timed automata. In: Peled, D.A., Tsay, Y.K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 370-384. Springer, Heidelberg (2005)
14. Merlin, P.M.: A Study of the Recoverability of Computing Systems. PhD Thesis, Irvine (1974)
15. Rokicki, T.G.: Representing and Modeling Circuits. PhD Thesis, Stanford Univ. Stanford, CA (1993)
16. Yoneda, T., Ryuba, H.: CTL model checking of Time Petri nets using geometric regions. IEEE Trans. on Inf. and Systems E99-D(3), 1-10 (1998)