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.
2012
2012
Landmark-enhanced abstraction heuristics
Highly Cited
2009
Highly Cited
2009
Formal Behavioral Modeling and Compliance Analysis for Service-Oriented Systems
In this paper, we present a framework for formal modeling and verification of service-based business processes with focus on… 
2006
2006
A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
Continuous-time Markov decision process are an important variant of labelled transition systems having nondeterminism through… 
2005
2005
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion problem in model-checking. Unfortunately, finding… 
2001
2001
A formal testing framework for UML statechart diagrams behaviours: from theory to automatic verification
We propose a formal testing framework for a behavioural subset of UML statechart diagrams (UMLSDs). A formal operational… 
2000
2000
Graphical Operational Semantics
We combine the methodology of Plotkin-style operational semantics with graph transformation concepts in order to specify the… 
1998
1998
Timed Bisimulation and Open Maps
Open maps have been used for defining bisimulations for a range of models, but none of these have modelled real-time. We define a… 
1997
1997
On Constructor-based Graph Rewriting Systems on Constructor-based Graph Rewriting Systems
We address the problem of graph rewriting as the underlying operational semantics of rule-based programming languages. We deene a… 
1995
1995
Swinging Data Types: Syntax, Semantics, and Theory
Initial structures are appropriate for modelling constructor-based data types because they fit the intuition and admit inductive… 
1993
1993
ACSR: An Algebra of Communicating Shared Resources with Dense Time and Priorities
This paper describes a timed process algebra called ACSR. ACSR supports synchronous timed actions and asynchronous instantaneous… 
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)