科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, a robust and as simple as possible concept of a Petri net (PN) computer is proposed. It has a similar structure and behavior to weak sound priority workflow nets. It is shown that all recursive functions are PN computable and, vice-versa, PN computable functions are recursive. This shows that the PN computers we have proposed have exactly the power of Turing machines. Complexity classes of PN computable functions are defined, and the relationship between them and similar complexity classes defined by counter machines is investigated. Finally, the close relationship between PN computers and weak sound (priority) workflow nets is investigated.
- 出版日期2015-3
