The tool TINA - Construction of abstract state spaces for petri nets and time petri nets

International Journal of Production Research

Volumn 42, Issue 14, 2004, Pages 2741-2756

  Berthomieu, B ^a   Ribet, P O ^a   Vernadat, F ^a  

^a LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; GRAPH THEORY; HEURISTIC METHODS; SEMANTICS; SET THEORY;

COMBINATORIAL EXPLOSION; STATE CLASSES; TIME PETRI NETS;

PETRI NETS;

EID: 3142637435     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540412331312688     Document Type: Conference Paper

References (28)

1. ARNOLD, A., BEGAY, D. and CRUBILLÉ, P., 1994, Construction and Analysis of Transition Systems with MEC (Singapore: Word Scientific).
2. BÉRARD, B., BIDOIT, M., FINKEL, A., LAROUSSINIE, F., PETIT, A., PETRUCCI, L. and SCHNOEBELEN, P., 2001, Systems and Software Verification Model-Checking Techniques and Tools (Berlin: Springer).
3. BERTHOMIEU, B., 2001, La méthode des classes d'états pour l'analyse des réseaux temporels - mise en œuvre, extension à la multi-sensibilisation. Proceedings of Modélisation des Systèmes Réactifs, Toulouse, France.
4. BERTHOMIEU, B. and DIAZ, M., 1991, Modeling and verification of time dependent systems using time Petri nets. IEEE Transactions on Software Engineering, 17(3), 259-273.
5. BERTHOMIEU, B. and MENASCHE, M., 1983, An enumerative approach for analyzing time Petri nets. Proceedings of IFIP Congress Series, 9, 41-46.
6. BERTHOMIEU, B. and VERNADAT, F., 2003, State class constructions for branching analysis of time Petri nets. Proceedings of Tools and Algorithms for the Construction and Analysis of Systems, Warsaw, Poland (Berlin: Springer).
7. DIAZ, M., 2001, Méthodes d'analyse des réseaux de Petri. In Les Réseaux de Petri. Modéles fondamentaux. Traité IC2 Information-Commande-Communication (Hermes Science).
8. FERNANDEZ, J.-C., GARAVEL, H., KERBRAT, R., MATEESCU, R., MOUNIER, L. and SIGHIREANU, M., 1996, A protocol validation and verification toolbox. Proceedings of 8th Conference on Computer-Aided Verification (Berlin: Springer).
9. FERNANDEZ, J.-C. and MOUNIER, L., 1991, A toolset for deciding behavioral equivalences. Proceedings of CONCUR'91 (Berlin: Springer).
10. FRIBOURG, L. and BÉRARD, B., 1999, Reachability analysis of (timed) Petri nets using real arithmetic. Proceedings of CONCUR'99 (Berlin: Springer).
11. GODEFROID, P., 1996, Partial-Order Methods for the Verification of Concurrent Systems (Berlin: Springer).
12. GODEFROID, P. and WOLPER, P., 1991, Using partial orders for the efficient verification of deadlock freedom and safety properties. Proceedings of Computer-Aided Verification CAV'91 (Berlin: Springer).
13. KARP, R. and MILLER, R., 1969, Parallel program schemata. Journal of Computer and System Sciences, 3(2), 147-195.
14. MAZURKIEWICZ, A., 1986, Trace theory, Petri Nets: applications and relationships to other model of concurrency, advances in Petri nets 1986, Part II. Proceedings of an advanced Course (Berlin: Springer).
15. MERLIN, P. M. and FARBER, D. J., 1976, Recoverability of communication protocols: Implications of a theoretical study. IEEE Trans. Comm. 24(9), 1036-1043.
16. MILNER, R., 1985, Communication and Concurrency (Engelwood Cliffs, NJ: Prentice Hall).
17. PAIGE, P. and TARJAN, R., 1987, Three partition refinement algorithms. SIAM Journal on Computing, 16(6), 973-989.
18. PELED, D., 1998, Ten years of partial order reduction. Proceedings of Computer-Aided Verification CAV'98 (Berlin: Springer).
19. RIBET, P.-O., VERNADAT, F. and BERTHOMIEU, B., 2002, On combining the persistent sets method with the covering steps graph method. Proceedings of FORTE 2002 (Berlin: Springer).
20. -X. Report 03053. LAAS-CNRS.
21. TRIPAKIS, S. and YOVINE, S., 1996, Analysis of timed systems based on time-abstracting bisimulations. Proceedings of Computer-Aided Verification CAV'96 (Berlin: Springer).
22. VALMARI, A., 1989, Stubborn sets for reduced state space generation. Proceedings of Application and Theory of Petri Nets (Berlin: Springer).
23. VALMARI, A., 1990, A stubborn attack on state explosion. Proceedings of Computer-Aided Verification CAV'90. ACM, DIMACS vol. 3, pp. 25-42.
24. VAN GLABBEEK, R. J., 1990, The linear time-branching time spectrum. Proceedings of CONCUR'90 (Berlin: Springer).
25. VERNADAT, F., AZÉMA, P. and MICHEL, F., 1996, Covering step graph. Proceedings of ATPN'96 (Berlin: Springer).
26. VERNADAT, F. and MICHEL, F., 1997, Covering step graph preserving failure semantics. Proceedings of ATPN'97 (Berlin: Springer).
27. VERNADAT, F. and RIBET, P., 2003, Graphes de Pas couvrants: une approche ordre partiel. In Vérification et mise en oeuvre des réseaux de Petri (Hermes Science).
28. YONEDA, T. and RYUBA, H., 1998, CTL model checking of Time Petri nets using geometric regions. IEEE Transactions on Information and Systems, E99-D(3), 1-10.