Computing Coupled Similarity

Coupled similarity is a notion of equivalence for systems with internal actions. It has outstanding applications in contexts where internal choices must transparently be distributed in time or space, for example, in process calculi encodings or in action refinements. No tractable algorithms for the computation of coupled similarity have been proposed up to now. Accordingly, there has not been any tool support.

• Publication year

  2019

• Venue

  International Conference on Tools and Algorithms for Construction and Analysis of Systems

• Publication date

  2019-04-06

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-030-17462-0_14
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Branching Time Model of CSP

  2017cited by this paper
• An O(mlogn) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation

  2017cited by this paper
• High-Level Programming Abstractions for Distributed Graph Processing

  2016cited by this paper
• Computing maximal weak and other bisimulations

  2016cited by this paper
• Encoding CSP into CCS

  2015cited by this paper
• Analysing and Comparing Encodability Criteria for Process Calculi

  2015cited by this paper
• LTSmin: High-Performance Language-Independent Model Checking

  2015cited by this paper
• FDR3 - A Modern Refinement Checker for CSP

  2014cited by this paper
• Certifiably Sound Parallelizing Transformations

  2013cited by this paper
• Bisimulation Reduction of Big Graphs on MapReduce

  2013cited by this paper
• The Quest for Minimal Quotients for Probabilistic Automata

  2013cited by this paper
• Howe's method for higher-order languages

  2012cited by this paper
• CADP 2011: a toolbox for the construction and analysis of distributed processes

  2012cited by this paper
• Game-theoretic simulation checking tool

  2011cited by this paper
• Symbolische Methoden für die probabilistische Verifikation: Zustandsraumreduktion und Gegenbeispiele

  2011cited by this paper
• Introduction to Bisimulation and Coinduction

  2011cited by this paper
• Algorithms for Computing Weak Bisimulation Equivalence

  2009cited by this paper
• Correcting a Space-Efficient Simulation Algorithm

  2008cited by this paper
• An efficient simulation algorithm based on abstract interpretation

  2007cited by this paper
• Finite Model Theory and Descriptive Complexity

  2007cited by this paper
• Sigref- A Symbolic Bisimulation Tool Box

  2006cited by this paper
• A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications

  2006cited by this paper
• Generalizing the Paige-Tarjan algorithm by abstract interpretation

  2006cited by this paper
• Logic and Games

  2006cited by this paper
• An efficient algorithm for computing bisimulation equivalence

  2004cited by this paper
• From Bisimulation to Simulation: Coarsest Partition Problems

  2003cited by this paper
• Using Coupled Simulations in Non-atomic Refinement

  2003cited by this paper
• Distributed Branching Bisimulation Reduction of State Spaces

  2003cited by this paper
• Why Is Simulation Harder than Bisimulation?

  2002cited by this paper
• Modal and Temporal Properties of Processes

  2001cited by this paper
• Impossible futures and determinism

  2001cited by this paper
• Action Contraction

  2000cited by this paper
• Principles of Program Analysis

  1999cited by this paper
• A hierarchy of equivalences for asynchronous calculi

  1998cited by this paper
• Modal and Temporal Logics for Processes

  1996cited by this paper
• Branching time and abstraction in bisimulation semantics

  1996cited by this paper
• Decoding Choice Encodings

  1996cited by this paper
• Computing simulations on finite and infinite graphs

  1995cited by this paper
• The Complete Axiomatization of Cs-congruence

  1994cited by this paper
• The Linear Time - Branching Time Spectrum II

  1993cited by this paper
• Multiway Synchronization Verified with Coupled Simulation

  1992cited by this paper
• The linear time - branching time spectrum

  1990cited by this paper
• Communication and concurrency

  1989cited by this paper
• Testing equivalence as a bisimulation equivalence

  1989cited by this paper
• Three Partition Refinement Algorithms

  1987cited by this paper
• Depth-First Search and Linear Graph Algorithms

  1972cited by this paper

• Process Equivalence Problems as Energy Games

  2023cites this paper
• Book review

  2022cites this paper
• A Game Characterization for Contrasimilarity

  2021cites this paper
• Deciding All Behavioral Equivalences at Once: A Game for Linear-time-Branching-time Spectroscopy

  2021cites this paper
• A Game for Linear-time–Branching-time Spectroscopy

  2021cites this paper
• Coupled similarity: the first 32 years

  2019influential citation
• Bachelor’s Thesis Computing Science Defining Apartness for Coupled Similarity on Labelled Transition Systems

  year unknowncites this paper