Abstract
Two ways of describing the behaviour of concurrent systems have widely been suggested: arbitrany interleaving and partial orders. Sometimes the latter has been claimed superior because concurrency is represented in a "true" way; on the other hand, some authors have claimed that the former is sufficient for all practical purposes.
Petri net theory offers a framework in which both kinds of semantics can be defined formally and hence compared with each other. Firing sequences correspond to interleaved behaviour while the notion of a process is used to capture partial order semantics. For most concurrent programming languages such as CSP or shared variable languages, sequence semantics is widely used but little work exists on process semantics.
This paper aims at obtaining formal results about the relationship between processes and firing sequences in net theory. We show that generally speaking, the class of behaviours defined by the two semantics is the same, but that it is difficult to find a "nice" relationship between sequences and processes. We also discuss one of the process axioms which is particularly interesting on intuitive grounds. Finally, we define the notion of a process also for concurrent programming languages, thus providing the basis to do similar analyses as have been done in net theory.
Preview
Unable to display preview. Download preview PDF.
References
E. Best: A Theorem on the Characteristics of Non-sequential Processes. Fundamenta Informaticae III.1 (1980), 77–94.
E.Best: The Relative Strength of K-density. In: [8], 261–276.
E.Best: Relational Semantics of Concurrent Programs (with some Applications). Formal Description of Programming Concepts II (ed.D.Bjørner) (1983), 431–452.
E. Best and A. Merceron: Discreteness, K-density and D-continuity in Occurrence Nets. LNCS 145 (1982), 73–83.
E.Best and A.Merceron: Frozen Tokens and D-continuity: A Study in Relating System Properties to Process Properties. Århus Workshop on Petri Nets (1984), to appear in: Advances in Net Theory (ed.G.Rozenberg).
E. Best and B. Randell: A Formal Model of Atomicity in Asynchronous Systems. Acta Informatica 16 (1981), 93–124.
E. Best and K. Voss: Free Choice Systems have Home States. Acta Informatica 21 (1984), 89–100.
W.Brauer (ed.): Net Theory and Applications. LNCS 84 (1980).
C. Fernández and P.S. Thiagarajan: D-Continuous Causal Nets: A Model of Non-sequential Processes. TCS 28 (1984), 171–196.
C.Fernández, M.Nielsen and P.S.Thiagarajan: A Note on Observable Occurrence Nets. Århus Workshop on Petri nets (1984), to appear in: Advances in Net Theory (ed. G.Rozenberg).
H.J.Genrich, K.Lautenbach and P.S.Thiagarajan: Elements of General Net Theory. In: [8], 21–163.
H.J.Genrich and E.Stankiewicz-Wiechno: A Dictionary of some Basic Notions of Net Theory. In: [8], 519–535.
U. Goltz and A. Mycroft: On the Relationship of CCS and Petri Nets. LNCS 172 (1984) 196–208.
U. Goltz and W. Reisig: The Non-sequential Behaviour of Petri Nets. Information and Control 57 (1983), 125–147.
M. Hennessy and G. Plotkin: Full Abstraction for a Simple Programming Language. LNCS 74 (1979), 108–120.
C.A.R. Hoare: Communicating Sequential Processes. CACM 21(8) (1978), 666–677.
A.Holt: Final Report on the Project on Information Systems Theory, Applied Data Research ADR6606 (1968).
L.Lamport: What Good is Temporal Logic? Inf. Proc. 83, North Holland (1983), 657–667.
P.E. Lauer: Synchronisation of Concurrent Processes without Globality Assumptions. ACM SIGPLAN Notices 16(9) (1981), 66–80.
P.E.Lauer, M.W.Shields and E.Best: Formal Theory of the Basic COSY Notation. Computing Laboratory, Univ. of Newcastle upon Tyne, TR143 (1979).
A.Mazurkiewicz: Concurrent Program Schemes and their Interpretation. Århus Univ. Computer Science Dep. Report DAIMI PB-78 (1977).
R.Milner: A Calculus of Communicating Systems. LNCS 92 (1980).
M. Nielsen, G. Plotkin and G. Winskel: Petri Nets, Event Structures and Domains I. TCS 13 (1981), 85–108.
S. Owicki and D. Gries: An Axiomatic Proof Technique for Parallel Programs I. Acta Informatica 6 (1976), 319–340.
C.A.Petri: Non-Sequential Processes. GMD-ISF Report 77.05 (1977).
C.A.Petri: Concurrency. In: [8], 251–260.
G.Plotkin: In a private discussion, G.Plotkin suggested b-discreteness as an axiom to be satisfied by non-sequential processes. (1979)
G.Plotkin: An Operational Semantics for CSP. Formal Description of Programming Concepts II (ed.D.Bjørner) (1983), 199–223.
H.Plünnecke: Schnitte in Halbordnungen. GMD-ISF Report 81.09 (1981). Abridged English version to appear in: Advances in Net Theory (ed. G.Rozenberg).
W. Reisig: Partial Order Semantics versus Interleaving Semantics for CSP-Like Languages and its Impact on Fairness. LNCS 172 (1984), 403–413.
W.Reisig: On the Semantics of Petri Nets. Bericht No.100, FB Informatik, University of Hamburg (1984).
M.W. Shields: Adequate Path Expressions. LNCS 70 (1979), 249–265.
G.Winskel: Events in Computation. PhD Thesis, Computer Science Department, Edinburgh University (1980).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag
About this paper
Cite this paper
Best, E. (1985). Concurrent behaviour: Sequences, processes and axioms. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds) Seminar on Concurrency. CONCURRENCY 1984. Lecture Notes in Computer Science, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15670-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-15670-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15670-3
Online ISBN: 978-3-540-39593-5
eBook Packages: Springer Book Archive