132 papers:
- VLDB-2015-ConsensFKP #bisimulation #query #summary
- S+EPPs: Construct and Explore Bisimulation Summaries, plus Optimize Navigational Queries; all on Existing SPARQL Systems (MPC, VF, SK, GP), pp. 2028–2039.
- FoSSaCS-2015-Winter #bisimulation #finite #λ-calculus
- A Completeness Result for Finite λ-bisimulations (JW), pp. 117–132.
- FM-2015-EisentrautGHS0 #bisimulation #probability
- Probabilistic Bisimulation for Realistic Schedulers (CE, JCG, HH, LS, LZ), pp. 248–264.
- QAPL-2015-LatellaMV #bisimulation
- A Definition Scheme for Quantitative Bisimulation (DL, MM, EPdV), pp. 63–78.
- QAPL-2015-LeeV #bisimulation #branch #congruence #probability
- Rooted branching bisimulation as a congruence for probabilistic transition systems (MDL, EPdV), pp. 79–94.
- ICLP-2015-Dovier #bisimulation #logic programming
- Logic Programming and Bisimulation (AD).
- LICS-2015-Carreiro #bisimulation #invariant #logic
- PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic (FC), pp. 341–352.
- LICS-2015-EnqvistSV #algebra #bisimulation #higher-order #logic #monad
- Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras (SE, FS, YV), pp. 353–365.
- ESOP-2014-CrubilleL #bisimulation #call-by #on the #probability #λ-calculus
- On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (RC, UDL), pp. 209–228.
- FoSSaCS-2014-DArgenioGL #axiom #bisimulation #metric #probability
- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules (PRD, DG, MDL), pp. 289–303.
- FoSSaCS-2014-KoutavasSH #bisimulation #communication #transaction
- Bisimulations for Communicating Transactions — (Extended Abstract) (VK, CS, MH), pp. 320–334.
- ICALP-v2-2014-GoncharovP #algebra #bisimulation #equation #monad #recursion
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads (SG, DP), pp. 196–207.
- ICALP-v2-2014-Jancar #bisimulation #equivalence #first-order
- Bisimulation Equivalence of First-Order Grammars (PJ), pp. 232–243.
- FM-2014-FengZ #automaton #bisimulation #equivalence #probability
- When Equivalence and Bisimulation Join Forces in Probabilistic Automata (YF, LZ), pp. 247–262.
- CHI-2014-ZadeAGDC #bisimulation #distance #edit distance #evolution #modelling
- Edit distance modulo bisimulation: a quantitative measure to study evolution of user models (HZ, SAA, SG, AKD, VC), pp. 1757–1766.
- VMCAI-2014-Song0G #bisimulation #logic #markov #process
- Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes (LS, LZ, JCG), pp. 98–117.
- FoSSaCS-2013-ChurchillM #bisimulation #composition
- Modular Bisimulation Theory for Computations and Values (MC, PDM), pp. 97–112.
- CIKM-2013-LuoFHWB #bisimulation #graph #memory management #reduction
- External memory K-bisimulation reduction of big graphs (YL, GHLF, JH, YW, PDB), pp. 919–928.
- POPL-2013-BonchiP #automaton #bisimulation #congruence #equivalence #nondeterminism
- Checking NFA equivalence with bisimulations up to congruence (FB, DP), pp. 457–468.
- VMCAI-2013-DehnertKP #bisimulation #markov #modelling #smt
- SMT-Based Bisimulation Minimisation of Markov Models (CD, JPK, DP), pp. 28–47.
- SIGMOD-2012-HellingsFH #bisimulation #graph #performance
- Efficient external-memory bisimulation on DAGs (JH, GHLF, HJH), pp. 553–564.
- FoSSaCS-2012-BiernackiL #bisimulation
- Applicative Bisimulations for Delimited-Control Operators (DB, SL), pp. 119–134.
- FoSSaCS-2012-DArgenioL #abstraction #bisimulation #congruence #probability #specification
- Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation (PRD, MDL), pp. 452–466.
- FoSSaCS-2012-HulsbuschK #bisimulation
- Deriving Bisimulation Congruences for Conditional Reactive Systems (MH, BK), pp. 361–375.
- FLOPS-2012-BiernackiL #bisimulation #normalisation
- Normal Form Bisimulations for Delimited-Control Operators (DB, SL), pp. 47–61.
- QAPL-2012-Bernardo #bisimulation #concurrent #markov #process
- Weak Markovian Bisimulation Congruences and Exact CTMC-Level Aggregations for Concurrent Processes (MB), pp. 122–136.
- POPL-2012-HurDNV #bisimulation #logic
- The marriage of bisimulations and Kripke logical relations (CKH, DD, GN, VV), pp. 59–72.
- FoSSaCS-2011-PierardS #bisimulation #calculus #distributed #higher-order #process
- Sound Bisimulations for Higher-Order Distributed Process Calculus (AP, ES), pp. 123–137.
- ICALP-v2-2011-CrafaR #abstract interpretation #algorithm #bisimulation #probability #simulation
- Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation (SC, FR), pp. 295–306.
- POPL-2011-FengDY #bisimulation #process #quantum
- Bisimulation for quantum processes (YF, RD, MY), pp. 523–534.
- CSL-2011-Otto #bisimulation
- The Freedoms of Guarded Bisimulation (MO), p. 2.
- DLT-2010-BerrimaR #algebra #bisimulation #equivalence
- Linking Algebraic Observational Equivalence and Bisimulation (MB, NBR), pp. 76–87.
- ICGT-2010-Hulsbusch #bisimulation #graph transformation
- Bisimulation Theory for Graph Transformation Systems (MH), pp. 391–393.
- FoSSaCS-2009-ChatzikokolakisNP #bisimulation
- Bisimulation for Demonic Schedulers (KC, GN, DP), pp. 318–332.
- FoSSaCS-2009-Gutierrez #bisimulation #concurrent #game studies #logic
- Logics and Bisimulation Games for Concurrency, Causality and Conflict (JG), pp. 48–62.
- FoSSaCS-2009-LengletSS #bisimulation #calculus
- Normal Bisimulations in Calculi with Passivation (SL, AS, JBS), pp. 257–271.
- CIAA-J-2008-AbdullaBHKV09 #automaton #bisimulation
- Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 685–700.
- ESOP-2008-BuscemiM #bisimulation #concurrent #constraints #π-calculus
- Open Bisimulation for the Concurrent Constraint π-Calculus (MGB, UM), pp. 254–268.
- FoSSaCS-2008-RangelKE #bisimulation
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions (GR, BK, HE), pp. 413–427.
- CIAA-2008-AbdullaBHKV #automaton #bisimulation
- Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 212–222.
- ICGT-2008-CenciarelliGT #bisimulation #graph #network
- Network Applications of Graph Bisimulation (PC, DG, ET), pp. 131–146.
- QAPL-2008-TrckaG #bisimulation #branch #congruence #probability
- Branching Bisimulation Congruence for Probabilistic Systems (NT, SG), pp. 129–143.
- LICS-2008-LassenL #bisimulation #morphism #normalisation #parametricity #polymorphism
- Typed Normal Form Bisimulation for Parametric Polymorphism (SBL, PBL), pp. 341–352.
- VMCAI-2008-Mastroeni #bisimulation
- Deriving Bisimulations by Simplifying Partitions (IM), pp. 157–171.
- ESOP-2007-FrancalanzaH #bisimulation #fault tolerance #proving
- A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) (AF, MH), pp. 395–410.
- FoSSaCS-2007-ParmaS #bisimulation #logic #probability
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems (AP, RS), pp. 287–301.
- TACAS-2007-KatoenKZJ #bisimulation #model checking #probability
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking (JPK, TK, ISZ, DNJ), pp. 87–101.
- CIAA-J-2006-AbdullaHK07 #automaton #bisimulation
- Bisimulation Minimization of Tree Automata (PAA, JH, LK), pp. 699–713.
- CIAA-2007-HogbergMM #automaton #bisimulation
- Backward and Forward Bisimulation Minimisation of Tree Automata (JH, AM, JM), pp. 109–121.
- DLT-2007-HogbergMM #automaton #bisimulation
- Bisimulation Minimisation for Weighted Tree Automata (JH, AM, JM), pp. 229–241.
- GT-VMT-2007-RangelKE #approach #bisimulation #verification
- Bisimulation Verification for the DPO Approach with Borrowed (GR, BK, HE).
- CSL-2007-LassenL #bisimulation #normalisation
- Typed Normal Form Bisimulation (SBL, PBL), pp. 283–297.
- LICS-2007-SangiorgiKS #bisimulation #higher-order
- Environmental Bisimulations for Higher-Order Languages (DS, NK, ES), pp. 293–302.
- ESOP-2006-KoutavasW #bisimulation #imperative
- Bisimulations for Untyped Imperative Objects (VK, MW), pp. 146–161.
- FoSSaCS-2006-Cao #bisimulation #higher-order #π-calculus
- More on Bisimulations for Higher Order π-Calculus (ZC), pp. 63–78.
- CIAA-2006-AbdullaKH #automaton #bisimulation
- Bisimulation Minimization of Tree Automata (PAA, LK, JH), pp. 173–185.
- CIAA-2006-ChengWC #analysis #bisimulation #branch #composition #on the fly
- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis (YPC, HYW, YRC), pp. 219–229.
- ICGT-2006-BonchiGK #bisimulation #encoding #process #visual notation
- Process Bisimulation Via a Graphical Encoding (FB, FG, BK), pp. 168–183.
- POPL-2006-KoutavasW #bisimulation #higher-order #imperative #reasoning #source code
- Small bisimulations for reasoning about higher-order imperative programs (VK, MW), pp. 141–152.
- CSL-2006-HarwoodMS #bisimulation
- Weak Bisimulation Approximants (WH, FM, AS), pp. 365–379.
- CSL-2006-Srba #automaton #bisimulation #equivalence #simulation
- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation (JS), pp. 89–103.
- LICS-2006-Lassen #bisimulation #normalisation #λ-calculus #μ-calculus
- Head Normal Form Bisimulation for Pairs and the λμ-Calculus (SBL), pp. 297–306.
- FoSSaCS-2005-LuttgenV #approach #bisimulation
- Bisimulation on Speed: A Unified Approach (GL, WV), pp. 79–94.
- TACAS-2005-BergaminiDJM #bisimulation #composition #equivalence #named #on the fly
- BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking (DB, ND, CJ, RM), pp. 581–585.
- ICALP-2005-Pous #bisimulation
- Up-to Techniques for Weak Bisimulation (DP), pp. 730–741.
- POPL-2005-SumiiP #abstraction #bisimulation #recursion
- A bisimulation for type abstraction and recursion (ES, BCP), pp. 63–74.
- LICS-2005-Lassen #bisimulation #normalisation
- Eager Normal Form Bisimulation (SL), pp. 345–354.
- FoSSaCS-2004-EhrigK #approach #bisimulation #graph grammar
- Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting (HE, BK), pp. 151–166.
- FoSSaCS-2004-LuttgenV #bisimulation #bound
- Bisimulation on Speed: Lower Time Bounds (GL, WV), pp. 333–347.
- FoSSaCS-2004-RamanathanMST #analysis #bisimulation #equivalence #network #probability #protocol #security
- Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols (AR, JCM, AS, VT), pp. 468–483.
- FoSSaCS-2004-WischikG #bisimulation #calculus
- Strong Bisimulation for the Explicit Fusion Calculus (LW, PG), pp. 484–498.
- POPL-2004-SumiiP #bisimulation
- A bisimulation for dynamic sealing (ES, BCP), pp. 161–172.
- LICS-2004-Sangiorgi #bisimulation #named
- Bisimulation: From The Origins to Today (DS), pp. 298–302.
- VLDB-2003-Ramanan #bisimulation #query #simulation #xml
- Covering Indexes for XML Queries: Bisimulation — Simulation = Negation (PR), pp. 165–176.
- FoSSaCS-2003-SassoneS #bisimulation
- Deriving Bisimulation Congruences: 2-Categories Vs Precategories (VS, PS), pp. 409–424.
- ICALP-2003-Doberkat #bisimulation #category theory #probability
- Semi-pullbacks and Bisimulations in Categories of Stochastic Relations (EED), pp. 996–1007.
- ICALP-2003-Mayr #bisimulation #equivalence #process
- Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes (RM), pp. 570–583.
- ICALP-2003-MerroN #bisimulation #mobile #proving
- Bisimulation Proof Methods for Mobile Ambients (MM, FZN), pp. 584–598.
- SEFM-2003-LanotteMT #automaton #bisimulation #probability #security
- Weak Bisimulation for Probabilistic Timed Automata and Applications to Security (RL, AMS, AT), pp. 34–43.
- VMCAI-2003-BossiFPR #bisimulation #security #verification
- Bisimulation and Unwinding for Verifying Possibilistic Security Properties (AB, RF, CP, SR), pp. 223–237.
- FoSSaCS-2002-YoshidaHB #bisimulation
- Linearity and Bisimulation (NY, KH, MB), pp. 417–434.
- FME-2002-BackesJP #bisimulation #composition #encryption #implementation #using
- Deriving Cryptographically Sound Implementations Using Composition and Formally Verified Bisimulation (MB, CJ, BP), pp. 310–329.
- POPL-2002-MerroH #bisimulation
- Bisimulation congruences in safe ambients (MM, MH), pp. 71–80.
- LICS-2002-DesharnaisJGP #bisimulation #metric #probability #process
- The Metric Analogue of Weak Bisimulation for Probabilistic Processes (JD, RJ, VG, PP), pp. 413–422.
- VMCAI-2002-FocardiPR #bisimulation #data flow #proving #security
- Proofs Methods for Bisimulation Based Information Flow Security (RF, CP, SR), pp. 16–31.
- ICALP-2001-BandiniS #axiom #bisimulation #probability
- Axiomatizations for Probabilistic Bisimulation (EB, RS), pp. 370–381.
- CAV-2001-DovierPP #algorithm #bisimulation #performance
- A Fast Bisimulation Algorithm (AD, CP, AP), pp. 79–90.
- ICLP-2001-BasuMRRV #bisimulation #constraints #logic programming #using
- Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming (SB, MM, CRR, IVR, RMV), pp. 166–180.
- FoSSaCS-2000-BaierS #bisimulation #probability
- Norm Functions for Probabilistic Bisimulations with Delays (CB, MS), pp. 1–16.
- FoSSaCS-2000-LaroussinieS #bisimulation #equivalence #explosion #problem
- The State Explosion Problem from Trace to Bisimulation Equivalence (FL, PS), pp. 192–207.
- TACAS-2000-HenzingerR #bisimulation
- Fair Bisimulation (TAH, SKR), pp. 299–314.
- ICALP-2000-Mayr #bisimulation #complexity #on the #parallel #problem #process
- On the Complexity of Bisimulation Problems for Basic Parallel Processes (RM), pp. 329–341.
- CSL-2000-Pauly #bisimulation #game studies #safety #source code
- From Programs to Games: Invariance and Safety for Bisimulation (MP), pp. 485–496.
- LICS-2000-JeffreyR #bisimulation #concurrent #formal method #ml
- A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names (AJ, JR), pp. 311–321.
- FoSSaCS-1999-Lenisa #bisimulation #equivalence #induction #logic
- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects (ML), pp. 243–257.
- TACAS-1999-Hirschkoff #bisimulation #on the #using #verification
- On the Benefits of Using the Up-To Techniques for Bisimulation Verification (DH), pp. 285–299.
- TACAS-1999-LiC #bisimulation #congruence #process
- Computing Strong/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing Processes (ZL, HC), pp. 300–314.
- DLT-1999-CaludeC #automaton #behaviour #bisimulation #nondeterminism
- Bisimulations and behaviour of nondeterministic automata (CC, EC), pp. 60–70.
- ICALP-1999-HirshfeldJ #algebra #bisimulation #decidability #process
- Bisimulation Equivanlence Is Decidable for Normed Process Algebra (YH, MJ), pp. 412–421.
- CAV-1999-ManoliosNS #bisimulation #model checking #proving #theorem proving
- Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation (PM, KSN, RS), pp. 369–379.
- LICS-1999-FioreCW #bisimulation
- Weak Bisimulation and Open Maps (MPF, GLC, GW), pp. 67–76.
- LICS-1999-JeffreyR #bisimulation #formal method #towards
- Towards a Theory of Bisimulation for Local Names (AJ, JR), pp. 56–66.
- ESOP-1998-AbadiG #bisimulation #encryption #protocol
- A Bisimulation Method for Cryptographic Protocols (MA, ADG), pp. 12–26.
- ICALP-1998-JancarKM #bisimulation #finite #process
- Deciding Bisimulation-Like Equivalences with Finite-State Processes (PJ, AK, RM), pp. 200–211.
- ICALP-1998-LiC #bisimulation #congruence #π-calculus
- Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the π-Calculus (ZL, HC), pp. 707–718.
- LICS-1998-BorealeS #bisimulation #calculus
- Bisimulation in Name-Passing Calculi without Matching (MB, DS), pp. 165–175.
- LICS-1998-DesharnaisEP #bisimulation #logic #markov #process
- A Logical Characterization of Bisimulation for Labeled Markov Processes (JD, AE, PP), pp. 478–487.
- ICALP-1997-Jancar #bisimulation #decidability #equivalence #process
- Bisimulation Equivalence is Decidable for One-Counter Processes (PJ), pp. 549–559.
- ICALP-1997-VinkR #algebra #approach #bisimulation #probability
- Bisimulation for Probabilistic Transition Systems: A Coalgebraic Approach (EPdV, JJMMR), pp. 460–470.
- CADE-1997-DennisBG #bisimulation #induction #proving #using
- Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs (LAD, AB, IG), pp. 276–290.
- CAV-1997-BaierH #bisimulation #probability #process
- Weak Bisimulation for Fully Probabilistic Processes (CB, HH), pp. 119–130.
- LICS-1997-BluteDEP #bisimulation #markov #process
- Bisimulation for Labelled Markov Processes (RB, JD, AE, PP), pp. 149–158.
- ICALP-1996-JancarE #bisimulation #petri net
- Deciding Finiteness of Petri Nets Up To Bisimulation (PJ, JE), pp. 478–489.
- ICFP-1996-FerreiraHJ #bisimulation #formal method
- A Theory of Weak Bisimulation for Core CML (WF, MH, AJ), pp. 201–212.
- CAV-1996-Baier #algorithm #bisimulation #polynomial #probability #simulation #testing
- Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation (CB), pp. 50–61.
- CAV-1996-TripakisY #analysis #bisimulation
- Analysis of Timed Systems Based on Time-Abstracting Bisimulation (ST, SY), pp. 232–243.
- TACAS-1995-EngbergL #bisimulation #performance
- Efficient Simplification of Bisimulation Formulas (UE, KSL), pp. 111–132.
- LICS-1994-Sewell #axiom #bisimulation #equation #first-order
- Bisimulation is Not Finitely (First Order) Equationally Axiomatisable (PS), pp. 62–70.
- ICALP-1993-InverardiPY #bisimulation #parametricity
- Extended Transition Systems for Parametric Bisimulation (PI, CP, DY), pp. 558–569.
- ICALP-1992-MilnerS #bisimulation
- Barbed Bisimulation (RM, DS), pp. 685–695.
- CAV-1992-BoualiS #bisimulation
- Symbolic Bisimulation Minimisation (AB, RdS), pp. 96–108.
- CAV-1992-Cerans #bisimulation #decidability #parallel #process
- Decidability of Bisimulation Equivalences for Parallel Timer Processes (KC), pp. 302–315.
- CAV-1991-Korver #bisimulation #branch
- Computing Distinguishing Formulas for Branching Bisimulation (HK), pp. 13–23.
- CSL-1991-Fernando #bisimulation #complexity #logic #recursion #set
- A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation (TF), pp. 96–110.
- ICALP-1990-GrooteV #algorithm #bisimulation #branch #equivalence #performance
- An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence (JFG, FWV), pp. 626–638.
- CAV-1990-Cleaveland #automation #bisimulation #on the
- On Automatically Explaining Bisimulation Inequivalence (RC), pp. 364–372.
- ICALP-1989-GrooteV #bisimulation #congruence #semantics
- Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) (JFG, FWV), pp. 423–438.
- POPL-1989-LarsenS #bisimulation #probability #testing
- Bisimulation Through Probabilistic Testing (KGL, AS), pp. 344–352.
- POPL-1988-BloomIM #bisimulation
- Bisimulation Can’t Be Traced (BB, SI, ARM), pp. 229–239.
- LICS-1988-Walker #bisimulation
- Bisimulations and Divergence (DJW), pp. 186–192.
- ICALP-1987-LarsenM #bisimulation #protocol #using #verification
- Verifying a Protocol Using Relativized Bisimulation (KGL, RM), pp. 126–135.
- LICS-1986-BensonB #automaton #bisimulation
- Strong Bisimulation of State Automata (DBB, OBS), pp. 77–81.