%V 527
%D 1991
%S Lecture Notes in Computer Science
%R 10.1007/3-540-54430-5_77
%A Rocco De Nicola
%L eprints375
%X Process algebras are generally recognized as a convenient tool for describing concurrent systems at different levels of abstraction. They rely on a small set of basic operators which correspond to primitive notions on concurrent systems and on one or more notions of behavioural equivalence or preorder. The operators are used to build complex systems from more elementary ones. The behavioural equivalences are used to study the relationships between different descriptions of the same system at different levels of abstractions and thus to perform part of the analysis.
%B CONCUR 1991
%E Jos C. M. Baeten
%E Jan Friso Groote
%T Action and State-based Logics for Process Algebras
%P 20-22
%I Springer