eprintid: 377
rev_number: 10
eprint_status: archive
userid: 32
dir: disk0/00/00/03/77
datestamp: 2011-06-13 09:04:16
lastmod: 2014-01-15 10:33:06
status_changed: 2011-06-13 09:04:16
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Ferrari, GianLuigi
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Observational Logics and Concurrency Models
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: 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.
date: 1990
date_type: published
series: Lecture Notes in Computer Science
volume: 472
publisher: Springer
pagerange: 301-315
id_number: 10.1007/3-540-53487-3_53
refereed: TRUE
isbn: 3-540-53487-3
book_title: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1990)
editors_name: V. Nori, Kesav
editors_name: E. Veni Madhavan, C.
official_url: http://dx.doi.org/10.1007/3-540-53487-3_53
funders: Research partially supported by Esprit Basic Research Action Program, Project 3011 CEDISYS, and by Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, Project LAMBRUSCO.
citation:   De Nicola, Rocco and Ferrari, GianLuigi  Observational Logics and Concurrency Models.   In:  Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1990).   Lecture Notes in Computer Science, 472 .  Springer, pp. 301-315.  ISBN 3-540-53487-3      (1990)