Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
BigraphCalculus of Broadcasting SystemsCoinductionCorecursion

Broader (3)

Formal methodsLogic in computer scienceTheoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Implicit Propagation in Structural Operational Semantics
Highly Cited
2006
Highly Cited
2006
Verification of Medical Guidelines by Model Checking - A Case Study
This paper presents a case study on how to apply formal modeling and verification in the context of quality improvement in… 
2006
2006
State Space Reduction of Rewrite Theories Using Invisible Transitions
State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique… 
2004
2004
Duality for Labelled Markov Processes
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present… 
2000
2000
Virtual symmetry reduction
We provide a general method for ameliorating state explosion via symmetry reduction in certain asymmetric systems, such as… 
2000
2000
Expressiveness of Updatable Timed Automata
Since their introduction by Alur and Dill, timed automata have been one of the most widely studied models for real-time systems… 
Highly Cited
1999
Highly Cited
1999
A Model for Interaction of Agents and Environments
A new abstract model of interaction between agents and environments considered as objects of different types is introduced… 
Highly Cited
1996
Highly Cited
1996
Conservative adaption of workflow
Business processes and, tberefore, workflow models are often adapted. Adaptations can be caused eitber by procedural changes… 
1988
1988
Axiomatising Finite Concurrent Processes
  • M. Hennessy
  • SIAM journal on computing (Print)
  • 1988
  • Corpus ID: 42805640
We re-examine the well-known observational equivalence between processes with a view to modifying it so as to distinguish between… 
1987
1987
Verifying a Protocol Using Relativized Bisimulation
The purpose of this paper is to illustrate a compositional proof method for communicating systems; that is, a method in which a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)