The University of Southampton
University of Southampton Institutional Repository

Open Ended Systems, Dynamic Bisimulation, and Tile Logic

Open Ended Systems, Dynamic Bisimulation, and Tile Logic
Open Ended Systems, Dynamic Bisimulation, and Tile Logic
The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a (weak) bisimulation, reconciles the bisimilarity as congruence property with such axioms and with the specification of open ended systems, where states can be reconfigured at run-time, at the cost of an infinitary operation at the meta-level. We show that the compositional framework offered by tile logic is suitable to deal with structural axioms and open ended systems specifications, allowing for a finitary presentation of context closure.
Bisimulation, SOS rule formats, dynamic bisimulation, tile logic.
3-540-67823-9
440-456
Bruni, R.
826fb8bb-f463-4440-8536-ef7f2da1a23a
Montanari, U.
45418952-b856-4910-94c1-5ff3c7c19938
Sassone, V.
df7d3c83-2aa0-4571-be94-9473b07b03e7
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. (2000) Open Ended Systems, Dynamic Bisimulation, and Tile Logic At IFIP International Conference on Theoretical Computer Science, IFIP TCS 2000.. , pp. 440-456.

Record type: Conference or Workshop Item (Paper)

Abstract

The SOS formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a (weak) bisimulation, reconciles the bisimilarity as congruence property with such axioms and with the specification of open ended systems, where states can be reconfigured at run-time, at the cost of an infinitary operation at the meta-level. We show that the compositional framework offered by tile logic is suitable to deal with structural axioms and open ended systems specifications, allowing for a finitary presentation of context closure.

PDF tiledynIFIPoff.pdf - Other
Download (219kB)

More information

Published date: 2000
Venue - Dates: IFIP International Conference on Theoretical Computer Science, IFIP TCS 2000., 2000-01-01
Keywords: Bisimulation, SOS rule formats, dynamic bisimulation, tile logic.
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 261960
URI: http://eprints.soton.ac.uk/id/eprint/261960
ISBN: 3-540-67823-9
PURE UUID: a8aebef4-89e5-4235-8c03-cd823ebd4ed4

Catalogue record

Date deposited: 13 Feb 2006
Last modified: 18 Jul 2017 08:56

Export record

Contributors

Author: R. Bruni
Author: U. Montanari
Author: V. Sassone

University divisions

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×