On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS

Authors:
Roberto M. Amadio
Affiliations:
Université Paris Diderot
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 10
Cited 0

Bisimulation and divergence

Information and Computation
The ESTEREL synchronous programming language: design, semantics, implementation

Science of Computer Programming
The algebra of timed processes, ATP: theory and application

Information and Computation
A process algebra for timed systems

Information and Computation
On reduction-based process semantics

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Communication and Concurrency

Communication and Concurrency
The SL Synchronous Language

IEEE Transactions on Software Engineering
Axiomatising Divergence

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Semantic barbs and biorthogonality

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a notion of convergence-sensitive bisimulation that is built just over the notions of (internal) reduction and of (static) context. In the framework of timed CCS, we characterise this notion of 'contextual' bisimulation via the usual labelled transition system. We also remark that it provides a suitable semantic framework for a fully abstract embedding of untimed processes into timed ones. Finally, we show that the notion can be refined to include sensitivity to divergence.