Bisimulation is an important notion for the veriication of distributed systems. Timed bisimulation is its natural extension to real time systems. Timed bisimulation is known to be decidable for timed au-tomata using the so-called region technique. We present a new, top down approach to timed bisimulation which applies the zone technique from the theory of hybrid systems. In contrast to the orig...

Higher-order process calculi have been receiving much attention in recent years for its significance in both theory and practice. Work on bisimulations has never ceased evolving, typically represented by Thomsen and Sangiorgi for their work on bisimulation theory and encoding to and from first-order process calculi. Fu puts forth linear higher-order π-calculus, and makes improvement to previous...

We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define nondeterministic labeled Markov processes (NLMP) and provide three definition of bisimulations: a bisimulation following a traditional characterization, a state based ...

The fundamental notion of bisimulation equivalence for concurrent processes, has escaped the world of continuous, and subsequently, hybrid systems. Inspired by the categorical framework of Joyal, Nielsen and Winskel, we develop novel notions of bisimulation equivalence for dynamical systems as well as control systems. We prove that this notion can be captured by the abstract notion of bisimulat...

The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulation-based preorders. A bisimulation-like characterization of this relation for arbitrary transition systems is given, relying on Abramsky’s characterization in terms of the finitary domain logic. More informati...

Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the bisimulation equivalence thus getting a semantics defined in a similar way, but supported for more reasonable (weaker) observational properties. Global bisimulations were introduced by Frutos et al. in order to study d...

We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the main behavioural relations on probabilistic nondeterministic processes, can be characterized by abstract interpretation. Both bisimulation and simulation can be obtained as completions of partitions and preorders, viewed as abstract domains, w.r.t. a pair of concrete functions that encode a PL...

One of the most satisfactory results in process theory is Milner’s axiomatization of strong bisimulation for regular CCS. This result holds for open terms with finite-state recursion. Wang has shown that timed bisimulation can also be axiomatized, but only for closed terms without recursion. In this paper, we provide an axiomatization for timed bisimulation of open terms with finite-state recur...

In our paper [RM02a] we describe an approach to weak bisimulation for coalgebras and show that parts of the theory of universal coalgebra (with strong bisimulation) can be obtained when considering coalgebras with weak bisimulations and weak homomorphisms. In the present paper we focus on uniformly adapting modal logics that characterise strong bisimulation for coalgebras to several kinds of ob...

We introduce and study bisimulations for coalgebras on Stone spaces [14]. Our notion of bisimulation is sound and complete for behavioural equivalence, and generalizes Vietoris bisimulations [3]. The main result of our paper is that bisimulation for a Stone coalgebra is the topological closure of bisimulation for the underlying Set coalgebra.