article

Free access

Distributed bisimulations

Authors:

Ilaria Castellani,

Matthew HennessyAuthors Info & Claims

Journal of the ACM (JACM), Volume 36, Issue 4

Pages 887 - 911

https://doi.org/10.1145/76359.76369

Published: 01 October 1989 Publication History

PDF eReader

Abstract

A new equivalence between concurrent processes is proposed. It generalizes the well-known bisimulation equivalence to take into account the distributed nature of processes. The result is a noninterleaving semantic theory; concurrent processes are differentiated from processes that are non-deterministic but sequential. The new equivalence, together with its observational version, is investigated for a subset of the language CCS, and various algebraic characterizations are obtained.

References

[1]

ACETO, L., DE NICOLA, R., AND FANTECHI, A. Testing equivalences for event structures. Nota interna B4-63. Istituto di Elaborazione dell'Informazione, Consiglio Nazionale delle Richerche, Pisa, Italy, 1986.]]

Google Scholar

[2]

A USTRY, D., AND BOUDOL, G. Alg6bre de processus et synchronisation. J. Theoret. Comput. Sci. 30 (1984), 91-131.]]

Google Scholar

[3]

BERGSTRA, J., AND KLOP, J. Algebra of communicating processes with abstraction. J. Theoret. Comput. Sci. 37, 1 (1985), 77-121.]]

Google Scholar

[4]

BOUDOL, G., AND CASTELLANI, I. Concurrency and atomicity. Theoret. Comput. Sci. 59 (1988), 25-84.]]

Crossref

Google Scholar

[5]

BROOKES, S., HOARE, C., AND ROSCOE, A. A theory of communicating sequential processes. J. ACM 31, 3 (July 1984), 560-599.]]

Crossref

Google Scholar

[6]

CASTELLANI, I. Bisimulations for concurrency. PhD dissertation, Univ. Edinburgh, Edinburgh, Great Britain, 1988.]]

Google Scholar

[7]

DEGANO, P., DE NICOLA, R., AND MONTANARI, U. Partial ordering derivations for CCS. In Proceedings of Fundamentals of Computer Science 85. Lecture Notes in Computer Science, vol. 199, Springer-Verlag, New York, 1985, pp. 520-533.]]

Crossref

Google Scholar

[8]

DE NICOLA, R., AND HENNESSY, M. Testing equivalences for processes. J. Theoret. Comput. Sci. 34 (1984), 83-133.]]

Google Scholar

[9]

GOLTZ, U., AND MYCROFT, A. On the relationship of CCS and Petri nets. In Proceedings of the International Conference on Automata. Languages and Programming (ICALP 84). Lecture Notes in Computer Science, vol. 172. Springer-Verlag, New York, 1984, pp. 196-208.]]

Crossref

Google Scholar

[10]

HENNESSY, M. Axiomatising finite concurrent processes. Tech. Rep. 4, Computer Science, Univ. Sussex, Sussex, Great Britain, 1987.]]

Google Scholar

[11]

HENNESSY, M., AND MILNER, R. Algebraic laws for nondeterminism and concurrency. J. ACM 32, 1 (Jan. 1985), 137-161.]]

Crossref

Google Scholar

[12]

HENNESSY, M., AND PLOTKIN, G. A term model for CCS. In Lecture Notes in Computer Science, vol. 88. Springer-Verlag, New York, 1980.]]

Crossref

Google Scholar

[13]

HOARE, C. Communicating Sequential Processes. Prentice-Hall, New York, 1985.]]

Crossref

Google Scholar

[14]

MILNER, R. Flowgraphs and flow algebras. J. ACM 26, 4 (Oct. 1979), 794-818.]]

Crossref

Google Scholar

[15]

MILNER, R. A calculus of communicating systems. In Lecture Notes in Computer Science, vol. 92. Springer-Verlag, New York, 1980.]]

Crossref

Google Scholar

[16]

MILNER, R. Calculi for synchrony and asynchrony. J. Theoret. Comput. Sci. 25 (1983).]]

Google Scholar

[17]

PARK, D. Concurrency and automata on infinite sequences. In Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York, 1981.]]

Crossref

Google Scholar

[18]

PRATT, V.R. Modelling concurrency with partial orders. Int. J. Prog. 15 (1986).]]

Crossref

Google Scholar

[19]

SHIELDS, M. Concurrent machines. The Comput. J. 28 (1985).]]

Google Scholar

[20]

TAUBNER, D., AND VOGLER, W. The step failure semantics. In Lecture Notes in Computer Science, vol. 247. Springer-Verlag, New York, 1987.]]

Crossref

Google Scholar

[21]

VAN GLABBEEK, R., AND VAANDRAGER, F. Petri net models for algebraic theories of concurrency. In Proceedings of the PARLE Conference (Eindhoven). Lecture Notes in Computer Science, vol. 254. Springer-Verlag, New York, 1987, pp. 224-242.]]

Crossref

Google Scholar

[22]

WINSKEL, G. Event structure semantics for CCS and related languages. In Proceedings of ICALP 82. Lecture Notes in Computer Science, vol. 140. Springer-Verlag, New York, 1982.]]

Crossref

Google Scholar

Cited By

View all

Gorrieri R(2022)A study on team bisimulation and H-team bisimulation for BPP netsTheoretical Computer Science10.1016/j.tcs.2021.09.037897:C(83-113)Online publication date: 2-Jan-2022
https://dl.acm.org/doi/10.1016/j.tcs.2021.09.037
Krishnan P(2022)Architectural CCSFormal Aspects of Computing10.1007/BF012145558:2(162-187)Online publication date: 2-Jan-2022
https://dl.acm.org/doi/10.1007/BF01214555
Gorrieri R(2021)Team bisimilarity, and its associated modal logic, for BPP netsActa Informatica10.1007/s00236-020-00377-458:5(529-569)Online publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1007/s00236-020-00377-4
Show More Cited By

Index Terms

Distributed bisimulations
1. Theory of computation

Recommendations

Vietoris Bisimulations

Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation between two descriptive modal models, together with the associated notion ...
Bisimulations for fuzzy transition systems revisited
Abstract
Bisimulation is a well-known behavioral equivalence for discrete event systems, and has recently been adopted and developed in fuzzy systems. In this paper, we propose a new bisimulation, i.e., the group-by-group fuzzy bisimulation, ...
Highlights
- We provide group-by-group fuzzy bisimulation, a new bisimulation for fuzzy transition systems.
Bisimulations for non-deterministic labelled markov processes

We extend the theory of labelled Markov processes to include internal non-determinism, which is a fundamental concept for the further development of a process theory with abstraction on non-deterministic continuous probabilistic systems. We define non-...

Reviews

Reviewer: Gabriel M. Ciobanu

The authors provide an operational semantics for simple CCS-like languages that take the distributed nature of processes into account. The finite CCS terms are interpreted as distributed labeled transition systems. Transitions have both local and global consequences, and the differences between these can be used to distinguish concurrent behaviors from purely nondeterministic behaviors. This work has been carried out only for a simple language, however. T he paper gives a complete axiomatization of the distributed bisimulation equivalence. The authors introduce communication in the language and propose a set of axioms for this extended language. The completeness of this set of axioms remains an open problem. The paper is self-contained. The manuscript was received in December 1987 and printed in October 1989. In the meantime, interesting related papers have appeared [1,2].

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 36, Issue 4

Oct. 1989

279 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/76359

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1989

Published in JACM Volume 36, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

54
Total Citations
View Citations
562
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)18

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gorrieri R(2022)A study on team bisimulation and H-team bisimulation for BPP netsTheoretical Computer Science10.1016/j.tcs.2021.09.037897:C(83-113)Online publication date: 2-Jan-2022
https://dl.acm.org/doi/10.1016/j.tcs.2021.09.037
Krishnan P(2022)Architectural CCSFormal Aspects of Computing10.1007/BF012145558:2(162-187)Online publication date: 2-Jan-2022
https://dl.acm.org/doi/10.1007/BF01214555
Gorrieri R(2021)Team bisimilarity, and its associated modal logic, for BPP netsActa Informatica10.1007/s00236-020-00377-458:5(529-569)Online publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1007/s00236-020-00377-4
Jiang YLiu SEhrhard T(2019)A fully abstract semantics for value-passing CCS for treesFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-018-7069-113:4(828-849)Online publication date: 1-Aug-2019
https://dl.acm.org/doi/10.1007/s11704-018-7069-1
Gorrieri R(2018)Verification of finite-state machines: A distributed approachJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2017.11.00596(65-80)Online publication date: Apr-2018
https://doi.org/10.1016/j.jlamp.2017.11.005
Luttik B(2016)Unique parallel decomposition in branching and weak bisimulation semanticsTheoretical Computer Science10.1016/j.tcs.2015.10.013612:C(29-44)Online publication date: 25-Jan-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.10.013
Ciobanu GHorne R(2013)Non-interleaving Operational Semantics for Geographically Replicated DatabasesProceedings of the 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing10.1109/SYNASC.2013.64(440-447)Online publication date: 23-Sep-2013
https://dl.acm.org/doi/10.1109/SYNASC.2013.64
Bósa K(2013)Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State MachinesSemantics in Data and Knowledge Bases10.1007/978-3-642-36008-4_2(18-49)Online publication date: 2013
https://doi.org/10.1007/978-3-642-36008-4_2
Luttik B(2012)Unique parallel decomposition in branching and weak bisimulation semanticsProceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science10.1007/978-3-642-33475-7_18(250-264)Online publication date: 26-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33475-7_18
Troeger D(2009)Step bisimulation is pomset equivalence on a parallel language without explicit internal choiceMathematical Structures in Computer Science10.1017/S09601295000001163:01(25)Online publication date: 4-Mar-2009
https://doi.org/10.1017/S0960129500000116
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Vietoris Bisimulations

Bisimulations for fuzzy transition systems revisited

Bisimulations for non-deterministic labelled markov processes

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations