Universidad Complutense de Madrid
E-Prints Complutense

Process equivalences as global bisimulations



Downloads per month over past year

Frutos Escrig, David de and Gregorio Rodríguez, Carlos (2006) Process equivalences as global bisimulations. Journal of universal computer science, 12 (11). pp. 1521-1550. ISSN 0948-695x

[thumbnail of Frutos28.pdf]

Official URL: http://jucs.org/jucs_12_11/process_equivalences_as_global/jucs_12_11_1521_1550_frutos.pdf


Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the bisimulation equivalence thus getting a semantics defined in a similar way, but supported for more reasonable (weaker) observational properties.
Global bisimulations were introduced by Frutos et al. in order to study different variants of non-determinism getting, in particular, a semantics under which the internal choice operator becomes associative. Global bisimulations are defined as plain bisimulations but allowing the use of new moves, called global transitions, that can change the processes not only locally in its head, but anywhere.
Now we are continuing the study of global bisimulation but focusing on the way different semantics can be characterised as global bisimulation semantics. In particular, we have studied ready similarity, on the one hand because it was proposed as the strongest reasonable semantics weaker than bisimulation; on the other hand, because ready similarity was not directly defined as an equivalence relation but as the nucleus of an order relation, and this open the question whether it is also possible to define it as a symmetric bisimulation-like semantics.
We have got a simple and elegant characterisation of ready similarity as a global bisimulation semantics, that provides a direct symmetric characterisation of it as an equivalence relation, without using any order as intermediate concept. Besides, we have found that it is not necessary to start from a simulation based semantics to get an equivalent global bisimulation. What has proved to be very useful is the axiomatic characterization of the semantics. Following these ideas we have got also global bisimulation for several semantics, including refusals and traces. That provides a general framework that allows to relate both intensional and extensional semantics.

Item Type:Article
Uncontrolled Keywords:bisimulation, ready simulation, refusal, traces, concurrent process equivalences and preorders, comparative semantics
Subjects:Sciences > Computer science
ID Code:20765
Deposited On:11 Apr 2013 09:00
Last Modified:10 Aug 2018 08:17

Origin of downloads

Repository Staff Only: item control page