Bisimulations on Data Graphs

DOI10.1613/JAIR.5637MaRDI QIDQ4605201zbMATH OpenOpenAlexFDO

Authors Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira

Publication date 7 March 2018

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.5637

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Concise graphs and functional bisimulations
• scientific article; zbMATH DE number 2087495
• Bisimulation and coverings for graphs and hypergraphs
• Foundations of Software Science and Computation Structures
• Network Applications of Graph Bisimulation
• Bisimilarity in term graph rewriting.
• Synthesising CCS bisimulation using graph rewriting
• Process Bisimulation Via a Graphical Encoding

Cited in

(10)

• Bisimilarity in term graph rewriting.
• Compositional equivalences based on open pNets
• Bisimulation and coverings for graphs and hypergraphs
• Model theory of XPath on data trees. I: Bisimulation and characterization
• Process Bisimulation Via a Graphical Encoding
• scientific article; zbMATH DE number 7407777 (Why is no real title available?)
• Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations
• An Incremental Bisimulation Algorithm
• Data graphs with incomplete information (and a way to complete them)
• Modal logic with relations over paths: a theoretical development through comonadic semantics

This page was built for publication: Bisimulations on Data Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605201)