Abstract
Occurrence nets are insufficient to precisely describe executions of elementary net systems with contacts. Traditionally, S-complementation is used for removal of contacts from the systems. Although the main behavior and properties of the original elementary net systems are preserved during S-complementation, their topologies may be changed greatly. This paper introduces a new kind of nets—expansion nets—for representing behavior of elementary net systems. As shown in the paper, expansion nets are natural as well as sufficient for describing the precise behavior of elementary net systems with or without contacts.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ochman'ski E. Occurrence traces, processes of elementary net systems. InProc. of the 8th European Workshop on Theory and Application of Petri Net Theory, 1987.
Lu Ruqian. P/R nets and P/R processes (I)(II). Science in China (Series A), 1992, 35(1): 21–31, 35(2): 148–157.
Thiagarajan P. Elementary Net Systems. Lecture Notes in Computer Science, Vol. 254, pp. 26–59, Springer-Verlag.
Cao Cungen. Nested Nets and Nested Processes for Elementary Net Systems. Technical Report, Institute of Mathematics, The Chinese Academy of Sciences, 1991. (in Chinese)
Author information
Authors and Affiliations
Additional information
For the biography ofCao Cungen, please see p.280 of this volume.
Rights and permissions
About this article
Cite this article
Cao, C. Expansion nets and expansion processes of elementary net systems. J. of Comput. Sci. & Technol. 10, 325–333 (1995). https://doi.org/10.1007/BF02943501
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02943501