Analyzing paths in Time Petri nets

Fundamenta Informaticae

Volumn 37, Issue 3, 1999, Pages 311-327

  Popova Zeugmann, Louchka ^a   Schlatter, Dirk ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Integer state; Parametric description of a transition sequence; Reachability of a state; Time Petri Net

Indexed keywords

EID: 0039772549     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-37307     Document Type: Article

References (10)

1. W.M.P. van der Aalst. Timed Coloured Petri Nets and their Application to Logigcs. PhD thesis, Tech. Univ. Eindhoven, 1992.
2. G. Berthelot and H. Boucheneb. Occurrence Graph for Interval Timed Colored Nets. In Application and Theory of Petri Nets, LNCS, pages 79-98. Springer, 1994.
3. B. Berthomieu and M. Diaz. Modeling and Verification of Time Dependent Systems Using Time Petri Nets. In Advances in Petri Nets 1984, volume 17, No. 3 of IEEE Trans. on Software Eng., pages 259-273, 1991.
4. B. Berthomieu and M. Menasche. An enumerative approach for analyzing time petri nets. In R. E. A. Masom (ed.), editor, Proceedings IFIP, volume 17, No. 3 of IEEE Trans. on Software Eng., pages 41-67, North-Holland, 1983.
5. M. Heiner and L. Popova-Zeugmann. Worst-case Analysis of Concurent Systems with Duration Interval Petri Nets. In E. Schnieder and D. Abel, editors, Entwurf komplexer Automatisierungssysteme. TU Braunschweig, IfRA, 1997.
6. P. Merlin. A Study of the Recoverability of Communikation Protocols. PhD thesis, University of California, Computer Science Dept., Irvine, 1974.
7. L. Popova. On Time Petri Nets. J. Inform. Process. Cybern. EIK 27(1991)4, pages 227-244, (1991).
8. L. Popova-Zeugmann. On Liveness and Boundedness in Time Petri Nets. In H.-D. Burkhard, L. Czaja, and P. Starke, editors, Proceedings of the CS&P'95 Workshop, pages 136-145, Warsaw, 1995.
9. L. Popova-Zeugmann. Essential States in Time Petri Nets. Informatik-Berichte 96, 1998.
10. P. H. Starke. INA - Integrated Net Analyzer. Berlin, 1997. Manual.