Bisimilarity is an extensional notion of equivalence of states of an automata. A bisimulation is a set of such equivalences among the states of automata. The bisimulation problem is the task of deciding bisimilarity for all pairs of states of an automata. The present work applies the Saturation [15] heuristic and interleaved MDD partition representation to the bisimulation problem. Previous wor...

In this paper we study the complexity of the Subgraph Bisimulation Problem, which stands to graph bisimulation as subgraph isomorphism stands to graph isomorphism, and we prove its NP-completeness. Our analysis is motivated by recent requirements coming from semistructured databases, where Subgraph Bisimulation can be used for retrieving semistructured data, even in presence of ‘cyclic’ queries...

In this paper we define a bisimulation concept for some very general models for stochastic hybrid systems (general stochastic hybrid systems). The definition of bisimulation builds on the ideas of Edalat and of Larsen and Skou and of Joyal, Nielsen and Winskel. The main result is that this bisimulation for GSHS is indeed an equivalence relation. The secondary result is that this bisimulation re...

Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs are modeled by fair state-transition systems, equivalence in the linear paradigm corresponds to fair trace equivalence, and in the branching paradigm corresponds to fair bisimulation. In this work we study the expressi...

The asynchronous-calculus is a variant of the-calculus where message emission is non-blocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation. Their bisimulation relies on a modiied transition system where, at any moment, a process can perform any input action. In this paper we propose a new notion of bisimulation for the asynchronous-calculus, deened on top o...

This paper presents a new characterization of the bisimulation congruence and D{bisimulation equivalences of the {calculus. The characterization supports a bisimulation{like proof technique which avoids explicit case analysis by taking a dynamic point of view of actions a process may perform , thus providing a new way of proving bisimulation congruence. The semantic theory of the {calculus is p...

In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based bisimulations, our distribution bisimulation is weaker, but corresponds more closely to linear properties. We construct a logic and a metric to describe our distribu...