计算一类递归方程的增广Petri网模型

The Extended Petri Net Model for a Kind of Recursion

递归方程的计算一直是一个较为复杂的问题,为更好的解决这一问题,建立各种模型是十分必要的。斐波那契数列是一个著名的递归方程,在这个方程的基础上,针对同类的递归方程建立了增广Petri网模型,并对模型的运行进行了分析。

It is a relative difficult problem to compute the recursion. Establishing various kinds of models is necessary to solve this problem. Fibonacci is a famous recursion equation. Based on this recursion, a model for a kind of recursion is set up and its run is analyzed.