eprintid: 388
rev_number: 8
eprint_status: archive
userid: 32
dir: disk0/00/00/03/88
datestamp: 2011-05-24 14:53:28
lastmod: 2011-07-11 14:36:27
status_changed: 2011-05-24 14:53:28
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: Aceto, Luca
creators_name: Fantechi, Alessandro
creators_name: De Nicola, Rocco
creators_id: 
creators_id: 
creators_id: r.denicola@imtlucca.it
title: Testing Equivalences for Event Structures
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: A flexible abstraction mechanism for models of concurrency, which allows systems which "look the same" to be considered equivalent, is proposed. Using three classes of atomic observations (sequences of actions, sequences of multisets of actions and partial orderings of actions) different information on the causal and temporal structure of Event Structures, a basic model of parallelism, is captured. As a result, three different semantic models for concurrent systems are obtained. These models can be used as the basis for defining interleaving, multisets or partial ordering semantics of concurrent systems. The common framework used to define the models allows us to study the relationship between these three traditional approaches to the semantics of concurrent communicating systems.
date: 1986
date_type: published
series: Lecture Notes in Computer Science
volume: 280
publisher: Springer
pagerange: 1-20
id_number: 10.1007/3-540-18419-8_9
refereed: TRUE
isbn: 3-540-18419-8
book_title: Mathematical Models for the Semantics of Parallelism
editors_name: Venturini Zilli, Marisa
official_url: http://dx.doi.org/10.1007/3-540-18419-8_9
citation:   Aceto, Luca and Fantechi, Alessandro and De Nicola, Rocco  Testing Equivalences for Event Structures.   In:  Mathematical Models for the Semantics of Parallelism.   Lecture Notes in Computer Science, 280 .  Springer, pp. 1-20.  ISBN 3-540-18419-8      (1986)