A proof of the Rank Theorem for extended free choice nets-Reference-Cited by-同舟云学术

A proof of the Rank Theorem for extended free choice nets

Published:1992 Issue: Volume: Page:134-153
ISSN:0302-9743
Container-title:Application and Theory of Petri Nets 1992
language:
Short-container-title:

Author:

Desel Jörg

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55676-1_8.pdf

Reference14 articles.

1. Best,E.; Desel,J.: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing 2 (2) (1990) 123–138

2. Best,E.; Desel,J.; Esparza,J.: Traps Characterise Home States in Free Choice Systems. To appear in Theoretical Computer Science (1992)

3. Campos,J.; Chiola,G.; Silva,M.: Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks. IEEE Transactions on Automatic Control, AC-36 (12) (1991) 1368–1382

4. Golom.J.M.; Campos,J.; Silva,M.: On Liveness Analysis Through Linear Algebraic Techniques. Departamento de Ingenieria Electrica e Informatica, Universidad de Zaragoza, Research Report GISI-RR-90-11 (1990)

5. Desel,J.: Struktur und Analyse von Free-Choice-Petrinetzen. Deutscher Universitäts-Verlag (1992)

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

1. Introduction of Petri Nets;Handbook of Research on Modern Cryptographic Solutions for Computer and Cyber Security;2016

2. Application of Hypergraphs to SMCs Selection;Technological Innovation for Collective Awareness Systems;2014

3. On the Equivalence Between Liveness and Deadlock-Freeness in Petri Nets;Applications and Theory of Petri Nets 2005;2005

4. Business Process Management Demystified: A Tutorial on Models, Systems and Standards for Workflow Management;Lectures on Concurrency and Petri Nets;2004

5. Characterizing Liveness Monotonicity for Weighted Petri Nets in Terms of Siphon-Based Properties;International Journal of Foundations of Computer Science;2003-08