Bisimulation

Known as: Bisimilar, Bisimilarity 
In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems that behave in the same way… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2002
Highly Cited
2002
In this paper we introduce a new class of labelled transition systems Labelled Markov Processes and define bisimulation for them… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Bisimulations that abstract from internal computation have proven to be useful for verification of compositionally defined… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 9
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In comparative concurrency semantics, one usually distinguishes between linear time and branching time semantic equivalences… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
An abstract de nition of bisimulation is presented It enables a uni form de nition of bisimulation across a range of di erent… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In the concurrent language CCS, two programs are considered the same if they are bisimilar. Several years and many researchers… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
In this paper we show how the testing equivalences and preorders on transition systems may be interpreted as instances of… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Abs t rac t . We describe a set of algorithmic methods, based on symbolic representation of state space, for minimisation of… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In this paper the question is considered in which cases a transition system specification in Plotkin style has 'good' properties… (More)
  • figure 1
  • table 1
  • table 2
  • table 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Abramsky’s seminal article [3] is devoted to a detailed concurrency-theoretic application of the author’s “theory of domains in… (More)
Is this relevant?