Combinatorics and Graph Theory


Refutation of the Petri Net Definition

Authors: Colin James III

We evaluate the definition of Petri nets from F ⊆ (P × T) ∪ (T × P) as F ⊆ (P → T) ∪ (T → P) where F, P, T stand for flow, places, tokens. It is not tautologous. This further disallows the conjecture of verification of work flows by reachability. These conjectures form a non tautologous fragment of the universal logic VŁ4.

Comments: Pages.

Download: PDF

Submission history

[v1] 2019-09-30 14:19:34

Unique-IP document downloads: 8 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus