Open Ended Systems, Dynamic Bisimulation, and Tile Logic
Bruni, R., Montanari, U. and Sassone, V. (2000) Open Ended Systems, Dynamic Bisimulation, and Tile Logic. In, IFIP International Conference on Theoretical Computer Science, IFIP TCS 2000. Springer, 440-456.
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Keywords:||Bisimulation, SOS rule formats, dynamic bisimulation, tile logic.|
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science
|Date Deposited:||13 Feb 2006|
|Last Modified:||10 Mar 2012 11:44|
|Contributors:||Bruni, R. (Author)
Montanari, U. (Author)
Sassone, V. (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)