Abstract
We investigate equivalence notions for concurrent systems. We consider ”linear time” approaches where the system behaviour is characterised as the set of possible runs as well as ”branching time” approaches where the conflict structure of systems is taken into account. We show that the usual interleaving equivalences, and also the equivalences based on steps (multisets of concurrently executed actions) are not preserved by refinement of atomic actions. We prove that ”linear time” partial order semantics, where causality in runs is explicit, is invariant under refinement. Finally, we consider various bisimulation equivalences based on partial orders and show that the strongest one of them is preserved by refinement whereas the others are not.
(Extended Abstract)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Austry, G. Boudol: Algèbre de processus et synchronisations, Theoretical Computer Science, Vol. 30, pp. 91–131, 1984
L. Aceto, M. Hennessy: Towards Action-Refinement in Process Algebras, Report 3/88, Computer Science, University of Sussex, Brighton, 1988
G. Boudol, I. Castellani: On the Semantics of Concurrency: Partial Orders and Transition Systems, Proc. TAPSOFT 87, Vol. I, LNCS 249, Springer-Verlag, pp 123–137, 1987
G. Boudol, I. Castellani: Permutation of Transitions: An Event Structure Semantics for CCS and SCCS, handout at the REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, The Netherlands, May 30–June 3, 1988
S.D. Brookes, C.A.R. Hoare, A.W. Roscoe: A Theory of Communicating Sequential Processes, Journal of the ACM, Vol. 31, No. 3, pp 560–599, 1984
L. Castellano, G. De Michelis, L. Pomello: Concurrency vs Interleaving: An Instructive Example, Bulletin of the EATCS 31, pp 12–15, 1987
P. Degano, R. De Nicola, U. Montanari: Observational Equivalences for Concurrency Models, in: Formal Description of Programming Concepts — III, Proc. of the third IFIP WG 2.2 working conference, ed. M. Wirsing, Elsevier Science Publishers B.V. (North Holland), pp 105–129, 1987
P. Degano, R. De Nicola, U. Montanari: A Distributed Operational Semantics for CCS Based on Condition/Event Systems, Acta Informatica Vol. 26, pp. 59–91, 1988
R. Devillers: On the Definition of a Bisimulation Notion Based on Partial Words, Petri Net Newsletter 29, pp 16–19, April 1988
R. De Nicola, M. Hennessy: Testing Equivalences for Processes, Theoretical Computer Science, Vol. 34, pp. 83–133, 1984
R.J. van Glabbeek, U. Goltz: Equivalence Notions for Concurrent Systems and Refinement of Actions, Arbeitspapiere der GMD 366, February 1989
J. Grabowski: On Partial Languages, Fundamenta Informatica IV.2, pp 427–498, 1981
R.J. van Glabbeek, F.W. Vaandrager: Petri Net Models for Algebraic Theories of Concurrency, Proc. PARLE, Vol. II, LNCS 259, Springer-Verlag, pp 224–242, 1987
M. Hennessy, R. Milner: Algebraic Laws for Nondeterminism and Cocurrency, Journal of the ACM, pp 137–161, 1985
G.J. Milne: CIRCAL and the Representation of Communication, Concurrency and Time, Transactions on Programming Languages and Systems (ACM), Vol. 7, No. 2, pp 270–298, 1985
R. Milner: A Calculus of Communicating Systems, LNCS 92, Springer-Verlag, 1980
R. Milner: Calculi for Synchrony and Asynchrony, Theoretical Computer Science, Vol. 25, No. 3, pp 267–310, 1983
M. Nielsen, G.D. Plotkin, G. Winskel: Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science, Vol. 13, No. 1, pp 85–108, 1981
D. Park: Concurrency and Automata on Infinite Sequences, Theoretical Computer Science (5th GI-Conference), LNCS 104, Springer-Verlag, pp 167–183, 1981
L. Pomello: Some Equivalence Notions for Concurrent Systems. An Overview, in: Advances in Petri Nets 1985, LNCS 222, Springer-Verlag, pp 381–400, 1986
V.R. Pratt: Modelling Concurrency with Partial Orders, International Journal of Parallel Programming, Vol. 15, No. 1, pp 33–71, 1986
B.A. Trakktenbrot, A. Rabinovich, J. Hirschfeld: Nets of Processes, Technical Report 97/88, Tel Aviv Univ., 1988
D. Taubner, W. Vogler: The Step Failure Semantics, Proc. STACS 87, LNCS 247, Springer-Verlag, pp 348–359, 1987
G. Winskel: Event Structures, in: Petri Nets: Applications and Relationships to Other Models of Concurrency, LNCS 255, Springer-Verlag, pp 325–392, 1987
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Glabbeek, R., Goltz, U. (1989). Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_71
Download citation
DOI: https://doi.org/10.1007/3-540-51486-4_71
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51486-2
Online ISBN: 978-3-540-48176-8
eBook Packages: Springer Book Archive