A petri-net variation that emulates recursion through acyclic structures and defined hierarchies. Explanation of design are in the slides.pdf file for now, but these are just rough ideas. Was thinking of making some formal definitions, frame rules and proofs - and a better implementation since this is just a POC.
- Compile-time deadlock detection
- More testing
- Fixing up DFS and perhaps exploring incidence matrix methods
- Task-queue based multi-threaded execution
- Fault tolerance centrality beyond betweenness
- Perhaps a paper