Sharp bisimulation is a refinement of branching bisimulation, parameterized by subset the system’s actions, called strong actions. This parameterization allows sharp to be tailored property under verification, whichever modal $$\mu$$ -calculus considered, while potentially reducing more than bisimulation. equivalence congruence for process algebraic operators such as parallel composition, hide,...

In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D’Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We...

Weighted automata are a generalization of nondeterministic that associate weight drawn from semiring $K$ with every transition and state. Their behaviours can be formalized either as weighted language equivalence or bisimulation. In this paper we explore the properties in framework coalgebras over (i) category $\mathsf{SMod}$ semimodules $K$-linear maps, (ii) $\mathsf{Set}$ sets maps. We show b...

This paper shows how modal mu-calculus formulae characterizing finite-state processes up to strong or weak bisimulation can be derived directly from the well-known greatest fixpoint characterizations of the bisimulation relations. Our derivation simplifies earlier proofs for the strong bisimulation case and, by virtue of derivation, immediately generalizes to various other bisimulation-like rel...

A notion of open bisimulation is formulated for the spi calculus, an extension of the πcalculus with cryptographic primitives. This notion of open bisimulation is based on the so-called hedged bisimulation, due to Borgström and Nestmann. Open bisimulation is shown to be sound with respect to hedged bisimulation, and futher, open bisimilarity is shown to be a congruence relation on finite spi pr...

Probabilistic transition system specifications (PTSSs) in the ntμfθ/ntμxθ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a congruence for all operator defined in such format. Starting from the ntμfθ/ntμxθ, we obtain restricted formats that guarantee that three coarser bisimu...

This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that ...

Abstract. The F&B-index is used to speed up pattern matching in tree and graph data, and is based on the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has been shown that the maximum F-bisimulation can be computed in linear time for DAGs. We build on this result, and introduce a linear algorithm for computing the maximum F&B-bisimulation for tree data. It firs...