Liveness in bounded Petri nets which are covered by T-invariants-Reference-Cited by-同舟云学术

Liveness in bounded Petri nets which are covered by T-invariants

Published:1994 Issue: Volume: Page:358-375
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Lautenbach Kurt,Ridder Hanno

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58152-9_20.pdf

Reference12 articles.

1. Bernd Baumgarten. Petri-Netze: Grundlagen und Anwendungen. BI-Wiss.-Verl., Mannheim; Wien; Zürich, 1990. (in German).

2. J. Campos, G. Chiola, and M. Silva. Properties and performance bounds for closed free choice synchronized monoclass queueing networks. IEEE Transactions on Automatic Control, 36(12), December 1991.

3. Jörg Desel. Regular marked petri nets. To appear in: Graph theoretic Concepts in Computer Science, 1993.

4. Javier Esparza and Manuel Silva. A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science, (102):185–205, 1992.

5. M. Hack. Extended state-machine allocatable nets (esma), an extension of free choice petri net results. Computation Structures Group Memo 78-1, MIT, Project MAC, 1978.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Transition Invariants in the Analysis of Concurrent Systems Modelled by Petri Nets;IFIP Advances in Information and Communication Technology;2024

2. Structural Characteristics of Petri Nets;Petri Nets;2022

3. Structurally Minimal Supervisors;Optimal Supervisory Control of Automated Manufacturing Systems;2013-01-23

4. Most Permissive Supervisors;Optimal Supervisory Control of Automated Manufacturing Systems;2013-01-23

5. Maximally Permissive Supervisors;Optimal Supervisory Control of Automated Manufacturing Systems;2013-01-23