Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,067,458 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
25 relations
Bigraph
Calculus of Broadcasting Systems
Coinduction
Corecursion
Expand
Broader (3)
Formal methods
Logic in computer science
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Transitions and Trees - An Introduction to Structural Operational Semantics
Hans Hüttel
2010
Corpus ID: 35660012
ion, concurrency, non-determinism and the features of functional programming languages. Along the way, the text introduces and…
Expand
2010
2010
Knots as processes: a new kind of invariant
L. G. Meredith
,
David F. Snyder
arXiv.org
2010
Corpus ID: 1045240
We exhibit an encoding of knots into processes in the {\pi}-calculus such that knots are ambient isotopic if and only their…
Expand
2003
2003
Deciding Bisimilarity between BPA and BPP Processes
P. Jančar
,
A. Kucera
,
Faron Moller
International Conference on Concurrency Theory
2003
Corpus ID: 13867292
We identify a necessary condition for when a given BPP process can be expressed as a BPA process. We provide an effective…
Expand
2001
2001
Architecting Software Systems with Process Algebras
M. Bernardo
,
P. Ciancarini
,
L. Donatiello
2001
Corpus ID: 55989731
Correct software components can give rise to architectural mismatches when assembled together in order to form a complex software…
Expand
2001
2001
A formal testing framework for UML statechart diagrams behaviours: from theory to automatic verification
D. Latella
,
M. Massink
Proceedings Sixth IEEE International Symposium on…
2001
Corpus ID: 907999
We propose a formal testing framework for a behavioural subset of UML statechart diagrams (UMLSDs). A formal operational…
Expand
2000
2000
Fair Bisimulation
T. Henzinger
,
S. Rajamani
International Conference on Tools and Algorithms…
2000
Corpus ID: 17316911
Bisimulations enjoy numerous applications in the analysis of labeled transition systems. Many of these applications are based on…
Expand
2000
2000
Graphical Operational Semantics
A. Corradini
,
R. Heckel
,
U. Montanari
ICALP Satellite Workshops
2000
Corpus ID: 14911050
We combine the methodology of Plotkin-style operational semantics with graph transformation concepts in order to specify the…
Expand
1997
1997
On Constructor-based Graph Rewriting Systems on Constructor-based Graph Rewriting Systems
R. Echahed
,
J. Janodet
1997
Corpus ID: 14473142
We address the problem of graph rewriting as the underlying operational semantics of rule-based programming languages. We deene a…
Expand
1996
1996
A Machine Verified Distributed Sorting Algorithm
J. Andersen
,
Edwin A. Harcourt
,
K. V. S. Prasad
1996
Corpus ID: 1166537
We present a verification of a distributed sorting algorithm in ALF, an implementation of Martin L¨of's type theory. The…
Expand
1993
1993
ACSR: An Algebra of Communicating Shared Resources with Dense Time and Priorities
Patrice Brémond-Grégoire
,
Insup Lee
,
Richard A. Gerber
International Conference on Concurrency Theory
1993
Corpus ID: 6038658
This paper describes a timed process algebra called ACSR. ACSR supports synchronous timed actions and asynchronous instantaneous…
Expand