Bisimulation (and, more generally, co-induction) can be regarded as one of the most important contributions of Concurrency Theory to Computer Science. Nowadays, bisimulation and the co-inductive techniques developed from the idea of bisimulation are widely used, not only in Concurrency, but, more broadly, in Computer Science, in a number of areas: functional languages, object-oriented languages...

The relationships between various equivalences on configuration structures, including interleaving bisimulation (IB), step bisimulation (SB) and hereditary history-preserving (HH) bisimulation, have been investigated by van Glabbeek and Goltz (and later Fecher). Since HH bisimulation may be characterised by the use of reverse as well as forward transitions, it is of interest to investigate form...

Bisimulation is a seemingly attractive state-space minimization technique because it can be computed automatically and yields the smallest model preserving all-calculus formulas. It is considered impractical for symbolic model checking, however, because the required BDDs are prohibitively large for most designs. We revisit bisimulation minimization, this time in an automata-theoretic framework....

In this dissertation we investigate presheaf models for concurrent computation. Our aim is to provide a systematic treatment of bisimulation for a wide range of concurrent process calculi. Bisimilarity is defined abstractly in terms of open maps as in the work of Joyal, Nielsen and Winskel. Their work inspired this thesis by suggesting that presheaf categories could provide abstract models for ...

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...

A process algebra is defined where parallel composition is structured around synchronous communication. Its essential difference with CCS is the hypothesis that internal actions must be observable for the clock; consequently, in our formalism (strong) bisimulation will be the basis for information flow analysis, instead of equivalences based on trace or weak bisimulation. Bisimulation reduces i...

We investigate split and ST bisimulation semantics, in particular the deadlock behaviour of processes in these semantics. \"le define and axiomatise a variant of ACP, where atomic actions and durational actions coexist, and define split and ST bisimulation semantics on this theory. We exhibit a closed term that has a deadlock in split semantics, but not in ST bisimulation semantics, and vice ve...

In this paper we propose a new equivalence relation for dynamical and control systems called bisimulation. As the name implies this definition is inspired by the fundamental notion of bisimulation introduced by R. Milner for labeled transition systems. It is however, more subtle than its namesake in concurrency theory, mainly due to the fact that here, one deals with relations on manifolds. We ...

In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric variant of the π-calculus. We distinguish two styles of such bisimulation definitions, i.e. “open” and “closed” bisimulation, the difference between which lies in that in open style the equivalence is closed under context in every bisimulation step whereas in closed style the equivalence is closed under contex...

Bisimulation is a notion of behavioural equivalence on the states of a transition system. Its definition has been extended to Markov decision processes, where it can be used to aggregate states. A bisimulation metric is a quantitative analog of bisimulation that measures how similar states are from a the perspective of long-term behavior. Bisimulation metrics have been used to establish approxi...