Hierarchical Nets: A Structured Petri Net Approach to Concurrency
<p>Liveness and safeness are two key properties Petri nets should have when they are used to model asynchronous systems. The analysis of liveness and safeness for general Petri nets, though shown to be decidable by Mayr [1981], is still computationally expensive (Lipton [1976]). In this paper...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
1982
|
| Online Access: | https://thesis.library.caltech.edu/6888/1/Choo_y-i_1982.pdf Choo, Young-il (1982) Hierarchical Nets: A Structured Petri Net Approach to Concurrency. Master's thesis, California Institute of Technology. doi:10.7907/t5w4-vt07. https://resolver.caltech.edu/CaltechTHESIS:04022012-150759898 <https://resolver.caltech.edu/CaltechTHESIS:04022012-150759898> |
Internet
https://thesis.library.caltech.edu/6888/1/Choo_y-i_1982.pdfChoo, Young-il (1982) Hierarchical Nets: A Structured Petri Net Approach to Concurrency. Master's thesis, California Institute of Technology. doi:10.7907/t5w4-vt07. https://resolver.caltech.edu/CaltechTHESIS:04022012-150759898 <https://resolver.caltech.edu/CaltechTHESIS:04022012-150759898>