Desdobramento para redes de petri k limitadas

DESDOBLAMIENTO PARA REDES DE PETRI k-LIMITADAS
Unfolding for K-Bounded Petri Nets
´
Franck Carlos Velez Benito1 , Luis Allan Kunzle2 , Fabiano Silva3
´
´
1 Universidade Federal do Parana, Brasil, [e-mail], Rua Cel. Francisco H. dos Santos, 100 Centro Politecnico
´
Jardim das Americas - Curitiba - PR
´
2 Universidade Federal do Parana, Brasil, [e-mail]
´
3 Universidade Federal do Parana, Brasil, [e-mail]

Resumen

the reachability graph, especially in real-world systems, generates the state explosion problem. McMillan proUno de los principales problemas de los sistemas de posed a technique called unfolding which generates a
´
automatas es el problema de alcanzabilidad. Resolver new network of smaller complexity than the reachability
´
este a traves del grafo de alcanzabilidad genera, espe- graph, which contains the set of states reachable, thus cialmente en los sistemas del mundo real, el problema preventing the explosion of states of systems modeled
´
´ de la explosion de estados. McMillan propuso una tecni- with networks Petri.
This technique has several implementations, the ca llamada desdoblamiento - unfolding - que genera una nueva red de menor complejidad que el grafo de alcan- mostly limited for safe petri nets, being that in the conzabilidad, que contiene el conjunto de estados alcanza- text of real-world systems, typically works with a lim´ bles, evitando as´ la explosion de estados de sistemas ited number of resources, often more than one unit. ı Therefore, it is important to have an implementation of modelados con redes de Petri.
´
Esta tecnica tiene varias implementaciones, en su the technique of unfolding, but for Petri nets k-bounded, mayor´a limitadas para redes de Petri seguras, y en el which allow to model systems with limited resources. ı This work presents, beyond important concepts of contexto de los sistemas del mundo real, por lo general se trabaja con un numero limitado de