Observational Congruences for Dynamically Reconfigurable Tile Systems
Observational Congruences for Dynamically Reconfigurable Tile Systems
The SOS formats that ensure that bisimilarity is a congruence fail in the presence of structural axioms on states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a weak bisimulation, reconciles the 'bisimilarity is a congruence' property with structural axioms and also with the specification of open ended systems, where states can be reconfigured at runtime. We show that the compositional framework offered by tile logic handles structural axioms and specifications of reconfigurable systems successfully. This allows for a finitary presentation of dynamic context closure, as internalized in the tile language. The case study of the pi-calculus illustrates the main features of our approach. Moreover, duality is exploited to model a second kind of reconfiguration: dynamic specialization.
dynamic bisimulation, bisimulation congruence, tile systems, tile logics, dynamic systems reconfiguration
331-372
Bruni, R.
826fb8bb-f463-4440-8536-ef7f2da1a23a
Montanari, U.
45418952-b856-4910-94c1-5ff3c7c19938
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
2005
Bruni, R.
826fb8bb-f463-4440-8536-ef7f2da1a23a
Montanari, U.
45418952-b856-4910-94c1-5ff3c7c19938
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
Bruni, R., Montanari, U. and Sassone, V.
(2005)
Observational Congruences for Dynamically Reconfigurable Tile Systems.
Theoretical Computer Science, 335 (2-3), .
Abstract
The SOS formats that ensure that bisimilarity is a congruence fail in the presence of structural axioms on states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a weak bisimulation, reconciles the 'bisimilarity is a congruence' property with structural axioms and also with the specification of open ended systems, where states can be reconfigured at runtime. We show that the compositional framework offered by tile logic handles structural axioms and specifications of reconfigurable systems successfully. This allows for a finitary presentation of dynamic context closure, as internalized in the tile language. The case study of the pi-calculus illustrates the main features of our approach. Moreover, duality is exploited to model a second kind of reconfiguration: dynamic specialization.
Text
tdbTCSOff.pdf
- Other
More information
Published date: 2005
Keywords:
dynamic bisimulation, bisimulation congruence, tile systems, tile logics, dynamic systems reconfiguration
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 261844
URI: http://eprints.soton.ac.uk/id/eprint/261844
ISSN: 0304-3975
PURE UUID: 2ad9badf-d514-4374-99ad-fe85235128ae
Catalogue record
Date deposited: 27 Jan 2006
Last modified: 14 Mar 2024 07:00
Export record
Contributors
Author:
R. Bruni
Author:
U. Montanari
Author:
V. Sassone
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics