| Article ID: | iaor1992661 |
| Country: | Germany |
| Volume: | 27 |
| Start Page Number: | 227 |
| End Page Number: | 244 |
| Publication Date: | Sep 1991 |
| Journal: | Elektronische Informationsverarbeitung und Kybernetik |
| Authors: | Popova L. |
This paper shows how to study boundedness and liveness of a finite Time Petri net in a discrete way by using it reachability graph. The computation of the reachability graph defined here is a recursive-enumerable process. The decidability of reachability for an arbitrary state in a finite and bounded Time Petri net is shown here.