We propose a metatheoretic approach to the definition of operational and abstract concurrent semantics for systems where name handling is a key issue. The main ingredients of our framework are connectors and tile logic. The former allow for the modeling of various kinds of graph-like and term-like structures, which can be useful in representing system distribution and causal histories. The latter is used to combine the use of connectors in space and in time (i,e., according to configurations and computations). As a detailed case study, we show how to define a concurrent operational semantics and causal weak bisimilarity for a flavor of basic parallel processes. (C) 2002 Elsevier Science B.V. All rights reserved.
|Autori:||Bruni R; Montanari U|
|Titolo:||Dynamic connectors for concurrency|
|Anno del prodotto:||2002|
|Digital Object Identifier (DOI):||10.1016/S0304-3975(02)00011-7|
|Appare nelle tipologie:||1.1 Articolo in rivista|