Thumbnail
Access Restriction
Subscribed

Author Bloom, Bard ♦ Istrail, Sorin ♦ Meyer, Albert R.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword CCS ♦ Bisimulation ♦ Process algebra ♦ Structural operational semantics
Abstract In the concurrent language CCS, two programs are considered the same if they are $\textit{bisimilar}.$ Several years and many researchers have demonstrated that the theory of bisimulation is mathematically appealing and useful in practice. However, bisimulation makes too many distinctions between programs. We consider the problem of adding operations to CCS to make bisimulation fully abstract. We define the class of GSOS operations, generalizing the style and technical advantages of CCS operations. We characterize GSOS congruence in as a bisimulation-like relation called $\textit{ready-simulation}.$ Bisimulation is strictly finer than ready simulation, and hence not a congruence for any GSOS language.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-01-03
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 1
Page Count 37
Starting Page 232
Ending Page 268


Open content in new tab

   Open content in new tab
Source: ACM Digital Library