%0 Book Section
%A De Nicola, Rocco
%A Ferrari, GianLuigi
%B Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1990)
%D 1990
%E V. Nori, Kesav
%E E. Veni Madhavan, C.
%F eprints:377
%I Springer
%P 301-315
%S Lecture Notes in Computer Science
%T Observational Logics and Concurrency Models
%U http://eprints.imtlucca.it/377/
%V 472
%X The aim of this paper is to examine some basic topics of true concurrency from the viewpoint of program logics. In particular, logical characterizations of observational (bisimulation) equivalences based on partial ordering observations are studied. To date, in contrast with the interleaving approach, such equivalences have been almost exclusively studied from the operational standpoint. We shall show that they can be defined in a logical setting and that standard modal and temporal techniques can also be applied to true concurrency models. As a result, the interleaving and the partial ordering views of concurrency are reconciled within a logical setting.