Abstract
A non-sequential process can be modelled by a partially ordered set of basic occurrences. Conversely, one is led to study the properties to be fulfilled by a poset so that it can reasonably be viewed as the model of a non-sequential process. To this end, Petri has proposed a set of concurrency axioms which include D-continuity, a generalised version of Dedekind's completeness property of the reals.
In this paper we give some general characterisations of D-continuous posets. We also study the relationship between D-continuity and the remaining concurrency axioms of Petri.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Best: A Theorem on the Characteristics of Non-sequential Processes. Fundamental Informaticae Vol. 3(1), 77–94 (1980).
E.Best: Concurrent Behaviour: Sequences, Processes and Axioms. Arbeitspapiere der GMD No.118 (1984), also in Proc. of CMU Workshop on Concurrency (1984).
E.Best and A.Merceron: Some Properties of Non-sequential Processes. GMD-ISF Report 82.07 (1982).
E. Best and A. Merceron: Discreteness, K-density and D-continuity of Occurrence Nets. Lecture Notes in Computer Science, Springer Verlag Vol.145, 73–83 (1982).
E. Best and A. Merceron: Concurrency Axioms and D-continuous Posets. 4th Petri Net Workshop, Toulouse (1983).
E.Best and A.Merceron: Frozen Tokens and D-continuity: A Study in Relating System Properties to Process Properties. In this Volume.
E. Best and B. Randell: A Formal Model of Atomicity in Asynchronous Systems. Acta Informatica Vol.16, 93–124 (1981).
C.Fernández, M.Nielsen and P.S.Thiagarajan: A Note on Observable Observable Occurrence Nets. 5th Petri Net Workshop, Århus (1984). Also to appear in this Volume.
C. Fernández and P.S. Thiagarajan: D-Continuous Causal Nets: A Model of Non-sequential Processes. TCS Vol.28, 171–196 (1984).
C.Fernández and P.S.Thiagarajan: A Note D-continuous Causal Nets. 3rd Petri Net Workshop, Varenna (1982).
H.J. Genrich and P.S. Thiagarajan: A Theory of Bipolar Synchronisation Schemes. TCS Vol.30, 241–318 (1984).
H.J. Genrich and E. Stankiewicz-Wiechno: A Dictionary of some Basic Notions of Net Theory. Lecture Notes in Computer Science, Springer Verlag Vol.84, 519–535 (1980).
W.M.Lu and A.Merceron: The Equivalence between the Well Behaved Bipolar Schemes and the Live and Safe Free Choice Nets without Frozen Tokens. 5th Petri Net Workshop, Århus (1984).
M. Nielsen, G. Plotkin and G. Winskel: Petri Nets, Event Structures and Domains. TCS Vol.13, 85–108 (1981).
C.A.Petri: Non-Sequential Processes. GMD-ISF Report 77.05 (1977).
C.A. Petri: Concurrency. Lecture Notes in Computer Science, Springer Verlag Vol.84, 251–260 (1980).
C.A. Petri: State Transition Structures in Physics and in Computation. International Journal on Theoretical Physics, Vol.21(12), 979–992 (1982).
H.Plünnecke: Schnitte in Halbordnungen. GMD-ISF Report 81.09 (1981). Shorter version also to appear in this Volume.
H.Plünnecke: Partial Orders. Arbeitspapiere der GMD No.93 (1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Best, E., Merceron, A. (1985). Concurrency axioms and D-continuous posets. In: Rozenberg, G. (eds) Advances in Petri Nets 1984. Lecture Notes in Computer Science, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15204-0_3
Download citation
DOI: https://doi.org/10.1007/3-540-15204-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15204-0
Online ISBN: 978-3-540-39320-7
eBook Packages: Springer Book Archive