Abstract
The idea of representing nonsequential processes as partially ordered sets (occurrence nets), is applied to place/transitions-nets (Petrinets), generalizing the well known notion of process for condition/ event-systems. For occurrence nets some theorems relating K-density, cut-finiteness and discreteness are proved. With these theorems we get the result that a place/transition-net is bounded if and only if its processes are K-dense.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E.Best: A Theorem on the Characteristics on Non-Sequential Processes. Fund. Informaticae, Vol. 3, No 1, pp.77–94 (1980).
E. Best, A. Merceron: Discreteness, K-Density and D-Continuity of Occurrence Nets. 6th GI-Conference on theoretical computer science (January 1983), to appear.
C. Fernandez, P.S. Thiagarajan: Some Properties of D-continuous Causal Nets. ICALP 1982, Lecture Notes in Computer Science 140 (July 1982).
H.J. Genrich, E. Stankiewicz-Wiechno: A Dictionary of Some Basic Notions of Net Theory. Advanced Course on General Net Theory of Processes and Systems Hamburg, Lecture Notes in Computer Science 84, Springer Verlag 1980.
J. Grabowski: On Partial Languages. Preprint No. 40/79, Sekt. Mathematik, Humboldt-Univ. (October 1979).
D.E. Knuth: The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison-Wesley Publishing Company, second edition 1973.
A. Mazurkiewicz: Concurrent Program Schemes and their Interpretation. Report DAIMI PB-78, Computer Science Department, Aarhus University, Aarhus, Denmark (1977).
M. Nielsen, G. Plotkin, G. Winskel: Petri Nets, Event Structures and Domains. Theoretical Computer Science, Vol. 13, pp. 85–108 (1981).
J.L. Peterson: Petri Net Theory and the Modeling of Systems, Prentice-Hall, Inc. 1981.
C.A. Petri: Non-Sequential Processes. GMD-ISF Report 77-05 (1977).
C.A. Petri: Concurrency. Lecture Notes in Computer Science Vol. 84, pp. 251–260 (1980).
H. Plünnecke: Schnitte in Halbordnungen. GMD-ISF Report 81–09 (April 1981).
W. Reisig: Processes of Marked, Arc-Weighted Nets. In: Petri Nets and Related System Models, Newsletter No. 5 (June 1980).
G. Rozenberg, R. Verreadt: Subset Languages of Petri Nets. Third European Workshop on Applications and Theory of Petri Nets. Varenna, Sept. 27–30, 1982, to appear.
P. Starke: Processes in Petri Nets. In: Elektronische Informationsverarbeitung und Kybernetik, Vol. 17, No. 8–9 (1981).
J. Winkowski: An Algebraic Description of System Behaviours. Theoretical Computer Science, Vol. 21, Number 3, December 1982 pp. 315–340
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goltz, U., Reisig, W. (1983). Processes of place/transition-nets. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036914
Download citation
DOI: https://doi.org/10.1007/BFb0036914
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive