Abstract
The present paper shows how an equivalence relation on the set of firing sequences of general nets, which have the same set of processes, should be defined. Using this results a construction of a 1-safe Petri net from any net with finite capacities is given, and it preservers, in a certain sense, the set of processes. Some regular properties of the set of processes of bounded nets are obtained.
Preview
Unable to display preview. Download preview PDF.
References
E.Best: Concurrent behaviour: sequences, processes and axioms. LNCS 197, 221–245(1984)
E.Best and C.Fernandez: Non-sequential processes. A Petri net view. Springer-Verlag 1988
E.Best and C.Fernandez: Notation and Terminology on Petri net theory. Arbeitspapiere der GMD 195(March 1987)
U.Golst and W.Reisig: The non-sequential behaviour of Petri nets. Information and Control 57 No. 2–3(1983),125–147
D.V. Hung and E. Knuth: Semi-commmutations and Petri nets. Theoretical Computer Science 64(1989), 67–81
Kamal Lodaya, Madhavan Mukund, R Ramanujiam and P.S. Thiagarajian: Models and Logic for true concurrency. Sadhana 17, Part 1, (March 1992),131–165
A.Mazurkiewicz: Concurrent Program Schemes and their Interpretation. Arhus University, Computer Science Department, DAIMI PB-78(July 1977)
W.Reizig: On the semantics of Petri nets. Bericht 100, FB Informatik. University of Hamburg (1984)
W. Zielonka: Notes on finite asynchronous automata. Theoret. Informat. and Appl. 21(1987), 99–135
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Hung, D., Van Dung, T. (1993). On the relation between firing sequences and processes of Petri nets. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_26
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57163-6
Online ISBN: 978-3-540-47923-9
eBook Packages: Springer Book Archive