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