Partial order behaviour and structure of Petri nets-Reference-Cited by-同舟云学术

Partial order behaviour and structure of Petri nets

Published:1990-03 Issue:1 Volume:2 Page:123-138
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Best Eike¹,Desel Jörg²

Affiliation:

1. Institut für Informatik, Universität Hildesheim, Samelsonplatz 1, D-3200, Hildesheim, FRG

2. Institut für Informatik, Technische Universität München, Arcisstr. 21, D-8000, München 2, FRG

Abstract

Abstract This paper argues that partial order semantics can be used profitably in the proofs of some nontrivial results in Petri net theory. We show that most of Commoner's and Hack's structure theory of free choice nets can be phrased and proved in terms of partial order behaviour. The new proofs are considerably shorter (and, arguably, more lucid) than the old ones; they also generalise the results from (safe) free choice nets to (bounded) extended free choice nets.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01888220.pdf

Reference15 articles.

1. Sequential and concurrent behaviour in Petri net theory

2. Best E. and Fernández C.: Nonsequential Processes. A Petri Net View . Springer Monographs on Theoretical Computer Science Vol. 13 1988.

3. Best E. and Thiagarajan P. S.: Some Classes of Live and Safe Petri Nets. In Concurrency and Nets K. Voss H. J. Genrich and G. Rozenberg (eds) pp. 71–94 Springer-Verlag 1987.

4. Commoner F.: Deadlocks in Petri Nets. Report Applied Data Inc. CA-7206-2311 (1972).

5. Desel J.: Synchronie-Abstand in Stellen/Transitionen-Systemen. Diplomarbeit Arbeitspapiere der GMD Nr. 341 1988.

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

1. Coverability in Well-Formed Free-Choice Petri Nets;Lecture Notes in Computer Science;2024

2. Extended Hierarchical Fuzzy Interpreted Petri Net;Sensors;2021-12-17

3. Formal Analysis of Segregation of Duties ( SoD ) in Accounting: A Computational Approach;Abacus;2020-06

4. Untanglings: a novel approach to analyzing concurrent systems;Formal Aspects of Computing;2015-11

5. Deriving Performance Bounds for Conditional Asynchronous Circuits Using Linear Programing;2013 IEEE 19th International Symposium on Asynchronous Circuits and Systems;2013-05