DocumentCode :
2587493
Title :
On Bisimilarities Induced by Relations on Actions
Author :
Arun-Kumar, S.
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., New Delhi
fYear :
2006
fDate :
11-15 Sept. 2006
Firstpage :
41
Lastpage :
49
Abstract :
In this paper, we give a straightforward generalization of bisimulations to "bisimulations induced by a pair of relations" on the underlying action set. We establish that many of the nice properties of bisimulations and bisimilarities may be thought of as actually being inherited from properties of the underlying relations on actions. We show that many bisimulation-based orderings (including strong and weak bisimilarity) defined in the literature are instances of this generalization. We also show by an example that there are instances where the equivalence of two systems (which intuitively have the same functionality), cannot be established directly by observational equivalence, but requires a more general notion. We finally give an adaptation of the "on-the-fly algorithm " of Fernandez and Mourner for computing generalized bisimilarities
Keywords :
bisimulation equivalence; concurrency theory; behavioural relation; bisimilarity; bisimulation-based orderings; concurrent system; on-the-fly algorithm; relations on actions; Calculus; Carbon capture and storage; Computer languages; Computer science; Power engineering computing; Software engineering;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Software Engineering and Formal Methods, 2006. SEFM 2006. Fourth IEEE International Conference on
Conference_Location :
Pune
Print_ISBN :
0-7695-2678-0
Type :
conf
DOI :
10.1109/SEFM.2006.28
Filename :
1698721
Link To Document :
بازگشت