Abstract
We survey notions of bisimulation and of bisimilar coverings both in the world of graph-like structures (Kripke structures, transition systems) and in the world of hypergraph-like general relational structures. The provision of finite analogues for full infinite tree-like unfoldings, in particular, raises interesting combinatorial challenges and is the key to a number of interesting model-theoretic applications. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Otto, M. (2013). Bisimulation and coverings for graphs and hypergraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7750 LNCS, pp. 5–16). Springer Verlag. https://doi.org/10.1007/978-3-642-36039-8_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
