eprintid: 340
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/40
datestamp: 2011-06-06 13:38:51
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-06 13:38:51
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: Corradini, Flavio
creators_name: De Nicola, Rocco
creators_name: Labella, Anna
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Graded Modalities and Resource Bisimulation
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: The logical characterization of the strong and the weak (ignoring silent actions) versions of resource bisimulation are studied. The temporal logics we introduce are variants of Hennessy-Milner Logics that use graded modalities instead of the classical box and diamond operators. The considered strong bisimulation induces an equivalence that, when applied to labelled transition systems, permits identifying all and only those systems that give rise to isomorphic unfoldings. Strong resource bisimulation has been used to provide nondeterministic interpretation of finite regular expressions and new axiomatizations for them. Here we generalize this result to its weak variant. 
date: 1999
date_type: published
series: Lecture Notes in Computer Science
volume: 1738
publisher: Springer
pagerange: 381-393
id_number: 10.1007/3-540-46691-6_31
refereed: TRUE
isbn: 3-540-66836-5
book_title: FSTTCS
editors_name: Pandu Rangan, C.
editors_name: Raman, Venkatesh
editors_name: Ramanujam, Ramaswamy
official_url: http://dx.doi.org/10.1007/3-540-46691-6_31
citation:   Corradini, Flavio and De Nicola, Rocco and Labella, Anna  Graded Modalities and Resource Bisimulation.   In:  FSTTCS.   Lecture Notes in Computer Science, 1738 .  Springer, pp. 381-393.  ISBN 3-540-66836-5      (1999)