5

There are not that many books on this subject, as it continues to evolve at a rapid pace. Classic books on process calculi (that don't focus on π-calculus-like mobility) are: C. A. R. Hoare, Communicating Sequential Processes. A. W. Roscoe, The Theory and Practice of Concurrency. M. C. B. Hennessy, Algebraic Theory of Processes. R. Milner, Concurrency ...


4

Testing whether a Petri net $\mathcal{N} = (P, T, F)$ does not terminate from a marking $M_0$ can be decided by testing whether there exist a firing sequence $\sigma$ and markings $M, M'$ such that $M_0 \rightarrow^* M \rightarrow^\sigma M'$, $|\sigma| > 0$ and $M' \geq M$. By [Rac78], if such a firing sequence exists, then there is one of length doubly ...


1

Found another article that helped me understand: COMPEXITY OF SOME PROBLEMS IN PETRI NETS* http://www.sciencedirect.com/science/article/pii/0304397577900147 This paper does a good job of explaining the difference between a k-bounded Petri-Net and an unbounded one. A Petri net is bounded if and only if it has a finite reachability set. Bouziane’s ...


Only top voted, non community-wiki answers of a minimum length are eligible