DocumentCode :
2893913
Title :
Equivalences on observable processes
Author :
Ulidowski, Irek
Author_Institution :
Dept. of Comput., Imperial Coll. of Sci., Technol. & Med., London, UK
fYear :
1992
fDate :
22-25 Jun 1992
Firstpage :
148
Lastpage :
159
Abstract :
The finest observable and implementable equivalence on concurrent processes is sought as part of a larger program to develop a theory of observable processes where semantics of processes are based on locally and finitely observable process behavior and all process constructs are allowed, provided their operational meaning is defined by realistically implementable transition rules. The structure of transition rules is examined, and several conditions that all realistically implementable rules should satisfy are proposed. It is shown that the ISOS contexts capture exactly the observable behavior of processes. This leads to the result that copy plus refusal equivalence is the finest implementable equivalence
Keywords :
automata theory; equivalence classes; concurrent processes; equivalence; observable processes; semantics of processes; transition rules; Concurrent computing; Delay effects; Educational institutions; ISO; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 1992. LICS '92., Proceedings of the Seventh Annual IEEE Symposium on
Conference_Location :
Santa Cruz, CA
Print_ISBN :
0-8186-2735-2
Type :
conf
DOI :
10.1109/LICS.1992.185529
Filename :
185529
Link To Document :
بازگشت