Abstract
This paper may be seen as proposing a tentative synthesis of various models of parallelism : we establish representation results for three kinds of Models for Distributed Systems, Labelled Transition Systems, Labelled Event Structures and Distributed Languages. For that purpose, we introduce a new representation model for concurrent systems, the Distributed Languages. Based on Words and Equivalence Relations, they are generalizations of the Trace Languages and model the behaviour of any asynchronous concurrent system.
(Extended Abstract)
The work presented in this paper has been partially carried within the Esprit Basic Research Action “Demon” and the PRC “C3”, CNRS.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
I.J. AALBERSBERG — G. ROZENBERG, Theory of Traces, T.C.S. 60 (1988) p.1–82
A. ARNOLD, Construction et analyse des systèmes de transitions: le système MEC, Proc. 1th Col, C3 Angoulême 1985, A.Arnold ed. Bordeaux Univ. France.
A. ARNOLD — An extension of the notion of traces and of asynchronous automata, T.R. 89–96, Bordeaux University.
R.ASSOUS — C.CHARRETTON, Nice Labelling of Event Structures, Bull. EATCS no41, 1990 June, p.184–190.
G. BOUDOL — I. CASTELLANI, Semantics of Concurrency: Partial Orders and Transition Systems, Techn. Rep. 550 (1987) I.N.R.I.A. Sophia Antipolis, France and TAPSOFT 87, Lect. Notes in Comp. Sci. 249, p.123–137.
I. CASTELLANI — P. FRANCESCHI — U. MONTANARI, Labelled Event Structures: A Model for Observable Concurrency, Proc. I.F.I.P. TC 2, Formal Description of Programming Concepts II (D.Bjorner ed.) Garmisch-Partenkirchen (1982) North-Holland Amsterdam, p.383–400.
R. CORI — D. PERRIN, Automates et commutations partielles, Rairo Inf. theor. Vol.19 no1 (1985) p. 21–32.
P. DEGANO — U. MONTANARI, Distributed Systems, Partial Ordering of Events and Event Structures, in: Control Flow and Data Flow: Concepts of Distributed Programming, NATO ASI Series F, Vol.14, M. Broy ed. (1985) p.7–106.
C. FERNANDEZ — M. NIELSEN — P.S. THIAGARAJAN, Notions of Realizable Non-Sequential Process, Fund. Infor. IX (1986) p.421–454.
M.P. FLE — G. ROUCAIROL, A Language Theoretic Approach to Serialisation Problem in Concurrent Systems, Lect. Notes in Comp. Sci. 199 (1985) p.128–145.
P. GASTIN, B.ROZOY,Infinitary Partially Commutative Monoids, T.R. 89-24 (1989) L.I.T.P. Paris 7 Univ. France.
H.J. HOOGEBOOM, G. ROZENBERG, Diamond Properties of State Spaces of Elementary Net Systems, T.R. 89-18, Leiden University, Holland.
L. LAMPORT, Time, Clocks and the Ordering of Events in a Distributed System, Comm. A.C.M. Vol.21 no7 (1978) p.558–565.
A. MAZURKIEWICZ, Traces, Histories and Graphs: Instances of Process Monoids, Lect. Notes in Comp. Sci. 176 (1984) p.115–133.
A. MAZURKIEWICZ, Semantics of Concurrent Systems: a Modular Fixed Point Trace Approach, Lect. Notes in Comp. Sci. 188 (1985) p.353–375.
A. MAZURKIEWICZ, Trace Theory, Paper no16, Advanced Course on Petri Nets, Bad Honnef (1986).
M. NIELSEN — G. PLOTKIN — G. WINSKEL, Petri Nets, Event Structures and Domains, Theor. Comp. Sci. 13 (1981) p. 85–108.
M. NIVAT Behaviours of Synchronized Systems of Processes, Tech. Rep.64 (1981) L.I.T.P. Paris 7 Univ. France.
D. PERRIN, Partial Commutations, ICALP 89, L.N.C.S. 372 (1989) p.637–651.
R. PRINOTH, An Algorithm to Construct Distributed Systems from State Machines, Protocol Specification Testing Verification, North Holland P.C. C.Sunshine ed. (1982) p.261–282.
G. ROZENBERG, Behaviour of Elementary Net Systems, Paper no7, Advanced Course on Petri Nets, Bad Honnef (1986).
G. ROZENBERG — P.S. THIAGARAJAN, Petri Nets: Basic Notions, Structure, Behaviour, Lect. Notes in Comp. Sci. 224 (1986) p.585–668.
B. ROZOY, Termination for Distributed Systems: Model and Cost, Computer and Artificial Intelligence 88-1, Inst. of Techn. Cybern. Slovak Acad. of Sciences
B. ROZOY, Un Modèle pour le Parallélisme: le Monoïde Distribué, thèse d'état, Tech. Rep. 1 (1987) L.I.U.C. Caen Univ. France.
B. ROZOY — P.S. THIAGARAJAN, Trace Monoids and Event Structures, Tech. Rep. 47 (1987) L.I.T.P. Paris 7 Univ. France, to appear in T.C.S.
M.W. SHIELDS, Concurrent Machines, The Computer Journal Vol.28 no5 (1985) p.449–465.
J. SIFAKIS, A Unified Approach for Studying the Properties of Transition Systems, Theor. Comp. Sci. 18 (1982) p.227–258.
P.H. STARKE, Multiprocessor Systems and Their Concurrency, Journal of Information Processing and Cybernetics E.I.K. Vol.20 no4 (1984) p.207–227, Abstract in: L.N.C.S.
P.H. STARKE, Traces and Semiworks, Lect. Notes in Comp. Sci. 208 (1985) p.332–349.
P.S. THIAGARAJAN, Some Behavioural Aspects of Net Theory, L.N.C.S. 317 (1988) p.630–653.
G. WINSKEL, Events in Computation, Ph.D. Thesis (1980) Edinburgh Univ. England.
G. WINSKEL, Categories of Models for Concurrency, L.N.C.S. 197 (1984).
G. WINSKEL, Event Structures, L.N.C.S. 255, p.325–392.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Rozoy, B. (1990). On distributed languages and models for distributed computation. In: Guessarian, I. (eds) Semantics of Systems of Concurrent Processes. LITP 1990. Lecture Notes in Computer Science, vol 469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53479-2_19
Download citation
DOI: https://doi.org/10.1007/3-540-53479-2_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53479-2
Online ISBN: 978-3-540-46897-4
eBook Packages: Springer Book Archive