Simulation-Based graph similarity

Authors:
Oleg Sokolsky;Sampath Kannan;Insup Lee
Affiliations:
Department of Computer and Information Science, University of Pennsylvania;Department of Computer and Information Science, University of Pennsylvania;Department of Computer and Information Science, University of Pennsylvania
Venue:
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2006

Citing 11
Cited 14

Dynamic programming: deterministic and stochastic models

Dynamic programming: deterministic and stochastic models
Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
The complexity of stochastic games

Information and Computation
A Simple Characterization of Stuttering Bisimulation

Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Structure-Based Similarity Search with Graph Histograms

DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Quantitative stochastic parity games

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quantitative solution of omega-regular games

Journal of Computer and System Sciences - STOC 2001
Metrics for labelled Markov processes

Theoretical Computer Science - Logic, semantics and theory of programming
A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching

SIAM Review
The Art of Computer Virus Research and Defense

The Art of Computer Virus Research and Defense

Matching and Merging of Statecharts Specifications

ICSE '07 Proceedings of the 29th international conference on Software Engineering
Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance

BPM '08 Proceedings of the 6th International Conference on Business Process Management
Diagnosing and Measuring Incompatibilities between Pairs of Services

DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Decision support for moving from a single product to a product portfolio in evolving software systems

Journal of Systems and Software
Deciding behaviour compatibility of complex correspondences between process models

BPM'10 Proceedings of the 8th international conference on Business process management
Measuring the compatibility of service interaction protocols

Proceedings of the 2011 ACM Symposium on Applied Computing
Perceived consistency between process models

Information Systems
Differencing labeled transition systems

ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
A relationship-based approach to model integration

Innovations in Systems and Software Engineering
Ranking semantic relationships between two entities using personalization in context specification

Information Sciences: an International Journal
Ranking semantic associations between two entities --- extended model

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part III
Similarity-Based Retrieval With Structure-Sensitive Sparse Binary Distributed Representations

Computational Intelligence
Automated Comparison of State-Based Software Models in Terms of Their Language and Structure

ACM Transactions on Software Engineering and Methodology (TOSEM)
Similarity in languages and programs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present symmetric and asymmetric similarity measures for labeled directed rooted graphs that are inspired by the simulation and bisimulation relations on labeled transition systems. Computation of the similarity measures has close connections to discounted Markov decision processes in the asymmetric case and to perfect-information stochastic games in the symmetric case. For the symmetric case, we also give a polynomial-time algorithm that approximates the similarity to any desired precision.