**6. References**


[10] Bodbar, B, Giacomini, L, Holding, DJ (2000) UML and Petri Nets for the Design and Analysis of Distributed Systems, Proc. of the IEEE Int. Conf. on Control Applications, pp. 610-615.

18 Will-be-set-by-IN-TECH

is being developed to implement a unified net as we described above, dealing with P/T and HLPN in the same environment. That is a good combination, capable to model and simulate timed and time nets (in that case using model checking) in the same environment, with the

Thus, it would be possible to have performance analysis that really fits the complexity of the

The authors acknowledge to all members of the Design Lab in Mechatronic Department for their work who are present in every part of this article be in the background, in the implementation of tools, in the search for new applications in the analysis of the problems already solved. Particularly we thank the work of Gustavo Costa, Arianna Salmon and Jose

advantage to have a sound and formal representation supporting all process.

problem addressed, adapting very easily to discrete or dense time approach.

*University of São Paulo, Mechatronics Department, Escola Politécnica, São Paulo, Brazil*

*Federal University of Pernambuco, Department of Mechanical Engineering, Recife, Brazil*

[1] Aalst, W van der (2002) Workflow Management: Models, Methods, and Systems, MIT

[2] Aalst, W van der (2004) Business Process Management Demystified: A Tutorial on Models, Systems and Standards for Workflow Mangement , LNCS 3098 pp 1-65. [3] Alur, R. and Dill, D. (1990) Automata for modeling real-time systems, *Lecture Notes in*

[4] Andrade, E, Maciel, P, Callou, G, Nogueira, B, Araujo, C (2011) An Approach Based in Petri Nets for Requirements Analysis, in in Petri Nets Applications, Pauwel Pawlewski

[5] Baresi, L, Pezze, M (2001) Uniform Approaches to Graphical Process Specification Techniques, Electronic Notes in Theoretical Computer Science, vol. 44, pp. 107-119. [6] Berthomieu, B. and Diaz, M. (1991). Modelling and verification of time dependent systems using time petri nets, *IEEE Trans. on Software Engineering* 17(3): 259–273. [7] Berthomieu, B. and Menasche, M. (1983) . An enumerative approach for analyzing time Petri nets, *in* R. E. A. Mason (ed.), *Information Processing: proceedings of the IFIP congress*

[8] Berthomieu, B., Ribet, P. O. and Vernadat, F. (2004). The tool tina - construction of abstract state spaces for petri nets and time petri nets, *Int. J. Prod. res.* 42(14): 2741–2756. [9] Berthomieu, B. and Vernadat, F. (2003). State class constructions for branching analysis

*1983*, Vol. 9, Elsevier Science Publishers, Amsterdam, pp. 41–46.

of time petri nets, *Lecture Notes in Computer Science* 2619: 442–457.

**Acknowledgements**

Armando S. P. Miralles.

**Author details** Silva, José Reinaldo

Del Foyo, Pedro M. G.

Press, 365 p.

*Computer Science* 443: 322–335.

(ed.), InTech, 752 p.

**6. References**


**Theory** 

