BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
process (7)
automata (5)
branch (5)
decid (4)
weak (4)

Stem bisimilar$ (all stems)

36 papers:

TACASTACAS-2015-Wijs #branch #gpu #similarity
GPU Accelerated Strong and Branching Bisimilarity Checking (AW), pp. 368–383.
QAPLQAPL-2015-AldiniB #automaton #markov #similarity
Expected-Delay-Summing Weak Bisimilarity for Markov Automata (AA, MB), pp. 1–15.
LICSLICS-2015-CzerwinskiJ #branch #process #similarity
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME (WC, PJ), pp. 168–179.
LICSLICS-2015-HeH #branch #similarity
Branching Bisimilarity on Normed BPA Is EXPTIME-Complete (CH, MH), pp. 180–191.
LICSLICS-2015-MurawskiRT #automaton #similarity
Bisimilarity in Fresh-Register Automata (ASM, SJR, NT), pp. 156–167.
FoSSaCSFoSSaCS-2014-Mio #calculus #similarity #μ-calculus
Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus (MM), pp. 335–350.
CIAACIAA-2014-MaiaMR #automaton #similarity
Partial Derivative and Position Bisimilarity Automata (EM, NM, RR), pp. 264–277.
ICALPICALP-v2-2014-YinFHHT #branch #similarity
Branching Bisimilarity Checking for PRS (QY, YF, CH, MH, XT), pp. 363–374.
LICSLICS-CSL-2014-CarreiroFVZ #automaton #similarity
Weak MSO: automata and expressiveness modulo bisimilarity (FC, AF, YV, FZ), p. 27.
FoSSaCSFoSSaCS-2013-OrejasBGM #graph transformation #similarity
Checking Bisimilarity for Attributed Graph Transformation (FO, AB, UG, NM), pp. 113–128.
TACASTACAS-2013-BacciBLM #on the fly #similarity
On-the-Fly Exact Computation of Bisimilarity Distances (GB, GB, KGL, RM), pp. 1–15.
LICSLICS-2013-BenediktGKM #automaton #similarity
Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.
FoSSaCSFoSSaCS-2012-ChenBW #complexity #on the #probability #similarity
On the Complexity of Computing Probabilistic Bisimilarity (DC, FvB, JW), pp. 437–451.
SACSAC-2012-AristizabalBVP #refinement #similarity
Partition refinement for bisimilarity in CCP (AA, FB, FDV, LFP), pp. 88–93.
CAVCAV-2012-MajumdarZ #approximate #modelling
Approximately Bisimilar Symbolic Models for Digital Control Systems (RM, MZ), pp. 362–377.
FoSSaCSFoSSaCS-2011-AristizabalBPPV #concurrent #constraints #programming #similarity
Deriving Labels and Bisimilarity for Concurrent Constraint Programming (AA, FB, CP, LFP, FDV), pp. 138–152.
ICALPICALP-v2-2010-HirschkoffP #on the #replication #similarity
On Bisimilarity and Substitution in Presence of Replication (DH, DP), pp. 454–465.
ICLPICLP-2010-P10 #concurrent #constraints #programming #similarity
Bisimilarity in Concurrent Constraint Programming (AAAP), pp. 236–240.
ESOPESOP-2009-BonchiM #algorithm #similarity
Minimization Algorithm for Symbolic Bisimilarity (FB, UM), pp. 267–284.
SASSAS-2009-Simon #analysis #optimisation #pointer #similarity #using
Optimizing Pointer Analysis Using Bisimilarity (LS), pp. 222–237.
LICSLICS-2009-Dominguez #calculus #logic #polymorphism #similarity
Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus (LD), pp. 81–90.
DLTDLT-2008-Jancar #decidability #similarity
Selected Ideas Used for Decidability and Undecidability of Bisimilarity (PJ), pp. 56–71.
QAPLQAPL-2008-ZhangZ #behaviour #pseudo
A Behavioural Pseudometric based on λ-Bisimilarity (JZ, ZZ), pp. 115–127.
FoSSaCSFoSSaCS-2006-JancarS #similarity #term rewriting
Undecidability Results for Bisimilarity on Prefix Rewrite Systems (PJ, JS), pp. 277–291.
SEFMSEFM-2006-Arun-Kumar #on the
On Bisimilarities Induced by Relations on Actions (SAK), pp. 41–49.
FoSSaCSFoSSaCS-2003-BreugelMOW #approximate #probability #similarity
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity (FvB, MWM, JO, JW), pp. 200–215.
LICSLICS-2003-Jancar #parallel #process #similarity
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete (PJ), p. 218–?.
DLTDLT-2002-Srba #similarity
Undecidability of Weak Bisimilarity for PA-Processes (JS), pp. 197–208.
ICALPICALP-2002-Srba #algebra #process #similarity
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard (JS), pp. 716–727.
FoSSaCSFoSSaCS-2001-Stirling #decidability #parallel #process #set #similarity
Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes (CS), pp. 379–393.
PADLPADL-2001-MukhopadhyayP #constraints #database #modelling #similarity
Constraint Database Models Characterizing Timed Bisimilarity (SM, AP), pp. 245–258.
ICALPICALP-1998-Lasota #similarity
Partial-Congruence Factorization of Bisimilarity Induced by Open Maps (SL), pp. 91–102.
POPLPOPL-1996-GordonR #calculus #first-order #similarity #type system
Bisimilarity for a First-Order Calculus of Objects with Subtyping (ADG, GDR), pp. 386–395.
ICALPICALP-1991-Vogler #similarity
Deciding History Preserving Bisimilarity (WV), pp. 495–505.
CAVCAV-1991-Huttel #branch #decidability #process #similarity
Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes (HH), pp. 2–12.
LICSLICS-1991-HuttelS #process #proving #similarity #word
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes (HH, CS), pp. 376–386.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.