TY  - CHAP
EP  - 315
N2  - 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.
T3  - Lecture Notes in Computer Science
TI  - Observational Logics and Concurrency Models
SN  - 3-540-53487-3
T2  - Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1990)
PB  - Springer
A1  - De Nicola, Rocco
A1  - Ferrari, GianLuigi
ED  - V. Nori, Kesav
ED  - E. Veni Madhavan, C.
M1  - 472
UR  - http://dx.doi.org/10.1007/3-540-53487-3_53
Y1  - 1990///
AV  - none
SP  - 301
ID  - eprints377
ER  -