Weak Bisimulation Approximants

15 years 6 months ago

Download www.newton.ac.uk

Abstract. Bisimilarity and weak bisimilarity are canonical notions of equivalence between processes, which are defined co-inductively, but may be approached

Will Harwood, Faron Moller, Anton Setzer

Real-time Traffic

Automated Reasoning | Basic Parallel Processes | CSL 2006 | Tight Ordinal Bound | Weak Bisimilarity |

claim paper

» Derivation of Characteristic Formulae

» A Characterisation of Weak Bisimulation Congruence

» Weak bisimulation for Probabilistic Timed Automata

» Notes on Generative Probabilistic Bisimulation

» A Syntactical Approach to Weak BiSimulation for Coalgebras

» Symbolic Bisimulations for Probabilistic Systems

» Approximate bisimulation relations for constrained linear systems

» Weak Equivalences in PsiCalculi

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	CSL
Authors	Will Harwood, Faron Moller, Anton Setzer

Comments (0)

Sciweavers

Weak Bisimulation Approximants

Automated Reasoning | Basic Parallel Processes | CSL 2006 | Tight Ordinal Bound | Weak Bisimilarity |

Explore & Download

Productivity Tools

Sciweavers